./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.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 c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:39:17,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:39:17,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:39:17,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:39:17,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:39:17,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:39:17,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:39:17,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:39:17,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:39:17,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:39:17,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:39:17,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:39:17,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:39:17,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:39:17,939 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:39:17,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:39:17,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:39:17,941 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:39:17,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:39:17,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:39:17,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:39:17,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:39:17,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:39:17,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:39:17,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:39:17,947 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:39:17,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:39:17,947 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:39:17,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:39:17,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:39:17,948 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:39:17,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:39:17,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:39:17,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:39:17,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:39:17,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:39:17,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:39:17,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:39:17,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:39:17,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:39:17,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:39:17,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:39:17,950 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 -> c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f [2024-11-08 20:39:18,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:39:18,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:39:18,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:39:18,154 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:39:18,154 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:39:18,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-11-08 20:39:19,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:39:19,576 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:39:19,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-11-08 20:39:19,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0508b178/40494399ae3844588cbffd9c3d10a0af/FLAGd446b0694 [2024-11-08 20:39:19,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0508b178/40494399ae3844588cbffd9c3d10a0af [2024-11-08 20:39:19,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:39:19,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:39:19,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:39:19,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:39:19,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:39:19,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e23c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19, skipping insertion in model container [2024-11-08 20:39:19,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:39:19,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i[915,928] [2024-11-08 20:39:19,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:39:19,844 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:39:19,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i[915,928] [2024-11-08 20:39:19,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:39:19,891 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:39:19,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19 WrapperNode [2024-11-08 20:39:19,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:39:19,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:39:19,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:39:19,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:39:19,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,929 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-11-08 20:39:19,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:39:19,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:39:19,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:39:19,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:39:19,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,963 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-08 20:39:19,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:39:19,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:39:19,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:39:19,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:39:19,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (1/1) ... [2024-11-08 20:39:19,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:39:20,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:39:20,015 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-08 20:39:20,022 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-08 20:39:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:39:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:39:20,063 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:39:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:39:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:39:20,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:39:20,142 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:39:20,144 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:39:20,441 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 20:39:20,442 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:39:20,476 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:39:20,476 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:39:20,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:20 BoogieIcfgContainer [2024-11-08 20:39:20,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:39:20,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:39:20,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:39:20,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:39:20,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:39:19" (1/3) ... [2024-11-08 20:39:20,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5636aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:39:20, skipping insertion in model container [2024-11-08 20:39:20,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:19" (2/3) ... [2024-11-08 20:39:20,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5636aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:39:20, skipping insertion in model container [2024-11-08 20:39:20,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:20" (3/3) ... [2024-11-08 20:39:20,492 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-11-08 20:39:20,530 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:39:20,530 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:39:20,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:39:20,597 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;@54d50d0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:39:20,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:39:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:39:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 20:39:20,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:20,618 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:39:20,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:20,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:20,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1107362262, now seen corresponding path program 1 times [2024-11-08 20:39:20,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:20,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527435174] [2024-11-08 20:39:20,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:39:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:39:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:39:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:39:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:39:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:39:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:39:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:39:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:39:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 20:39:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:39:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:39:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:39:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:39:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:39:20,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527435174] [2024-11-08 20:39:20,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527435174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:20,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:20,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:39:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656081665] [2024-11-08 20:39:20,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:20,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:39:20,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:20,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:39:20,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:39:20,997 INFO L87 Difference]: Start difference. First operand has 96 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:39:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:21,033 INFO L93 Difference]: Finished difference Result 185 states and 329 transitions. [2024-11-08 20:39:21,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:39:21,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 207 [2024-11-08 20:39:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:21,043 INFO L225 Difference]: With dead ends: 185 [2024-11-08 20:39:21,043 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 20:39:21,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-08 20:39:21,051 INFO L432 NwaCegarLoop]: 144 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, 144 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-08 20:39:21,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:39:21,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 20:39:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 20:39:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:39:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 144 transitions. [2024-11-08 20:39:21,095 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 144 transitions. Word has length 207 [2024-11-08 20:39:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:21,095 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 144 transitions. [2024-11-08 20:39:21,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:39:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 144 transitions. [2024-11-08 20:39:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 20:39:21,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:21,099 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:39:21,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:39:21,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:21,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash -909152972, now seen corresponding path program 1 times [2024-11-08 20:39:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:21,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032542897] [2024-11-08 20:39:21,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:21,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:39:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:39:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:39:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:39:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:39:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:39:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:39:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:39:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:39:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 20:39:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:39:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:39:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:39:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:39:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:39:21,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:21,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032542897] [2024-11-08 20:39:21,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032542897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:21,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:21,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:39:21,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086601671] [2024-11-08 20:39:21,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:21,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:39:21,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:21,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:39:21,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:39:21,785 INFO L87 Difference]: Start difference. First operand 92 states and 144 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:22,051 INFO L93 Difference]: Finished difference Result 354 states and 558 transitions. [2024-11-08 20:39:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:39:22,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2024-11-08 20:39:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:22,055 INFO L225 Difference]: With dead ends: 354 [2024-11-08 20:39:22,055 INFO L226 Difference]: Without dead ends: 265 [2024-11-08 20:39:22,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:39:22,061 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 348 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:22,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 546 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:39:22,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-08 20:39:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 179. [2024-11-08 20:39:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 110 states have internal predecessors, (151), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 20:39:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 283 transitions. [2024-11-08 20:39:22,103 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 283 transitions. Word has length 207 [2024-11-08 20:39:22,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:22,103 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 283 transitions. [2024-11-08 20:39:22,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:22,104 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 283 transitions. [2024-11-08 20:39:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 20:39:22,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:22,108 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:39:22,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:39:22,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:22,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1628530190, now seen corresponding path program 1 times [2024-11-08 20:39:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:22,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964566675] [2024-11-08 20:39:22,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:39:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:39:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:39:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:39:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:39:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:39:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:39:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:39:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:39:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 20:39:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:39:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:39:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:39:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:39:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:39:22,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:22,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964566675] [2024-11-08 20:39:22,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964566675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:22,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:22,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:39:22,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197303377] [2024-11-08 20:39:22,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:22,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:39:22,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:22,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:39:22,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:39:22,520 INFO L87 Difference]: Start difference. First operand 179 states and 283 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:22,815 INFO L93 Difference]: Finished difference Result 569 states and 901 transitions. [2024-11-08 20:39:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:39:22,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-08 20:39:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:22,823 INFO L225 Difference]: With dead ends: 569 [2024-11-08 20:39:22,823 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 20:39:22,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:39:22,825 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 127 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:22,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 494 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:39:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 20:39:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 355. [2024-11-08 20:39:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 218 states have (on average 1.3761467889908257) internal successors, (300), 218 states have internal predecessors, (300), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-08 20:39:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 564 transitions. [2024-11-08 20:39:22,893 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 564 transitions. Word has length 208 [2024-11-08 20:39:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:22,895 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 564 transitions. [2024-11-08 20:39:22,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 564 transitions. [2024-11-08 20:39:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 20:39:22,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:22,898 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:39:22,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:39:22,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:22,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash 617412940, now seen corresponding path program 1 times [2024-11-08 20:39:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614784860] [2024-11-08 20:39:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:39:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:39:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:39:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:39:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:39:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:39:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:39:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:39:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:39:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 20:39:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:39:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:39:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:39:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:39:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 20:39:23,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:23,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614784860] [2024-11-08 20:39:23,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614784860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:39:23,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532134021] [2024-11-08 20:39:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:23,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:39:23,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:39:23,158 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-08 20:39:23,160 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-08 20:39:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:23,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 20:39:23,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:39:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 32 proven. 96 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 20:39:23,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:39:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 20:39:23,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532134021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:39:23,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 20:39:23,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 20:39:23,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411148455] [2024-11-08 20:39:23,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 20:39:23,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 20:39:23,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:23,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 20:39:23,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:39:23,891 INFO L87 Difference]: Start difference. First operand 355 states and 564 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-08 20:39:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:24,066 INFO L93 Difference]: Finished difference Result 626 states and 982 transitions. [2024-11-08 20:39:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 20:39:24,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 208 [2024-11-08 20:39:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:24,068 INFO L225 Difference]: With dead ends: 626 [2024-11-08 20:39:24,069 INFO L226 Difference]: Without dead ends: 274 [2024-11-08 20:39:24,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 478 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 20:39:24,070 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 43 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:24,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 263 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:39:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-08 20:39:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2024-11-08 20:39:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 160 states have (on average 1.31875) internal successors, (211), 160 states have internal predecessors, (211), 99 states have call successors, (99), 6 states have call predecessors, (99), 6 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-08 20:39:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 409 transitions. [2024-11-08 20:39:24,094 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 409 transitions. Word has length 208 [2024-11-08 20:39:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:24,095 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 409 transitions. [2024-11-08 20:39:24,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-08 20:39:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 409 transitions. [2024-11-08 20:39:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 20:39:24,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:24,097 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:39:24,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 20:39:24,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:39:24,298 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:24,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:24,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1010439950, now seen corresponding path program 1 times [2024-11-08 20:39:24,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:24,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184690044] [2024-11-08 20:39:24,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:24,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:39:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:39:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:39:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:39:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:39:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:39:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:39:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:39:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:39:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:39:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:39:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:39:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:39:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:39:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:39:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:39:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 20:39:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:39:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:39:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:39:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:39:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:39:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 20:39:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:39:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:39:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:39:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:39:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:39:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:39:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:39:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:39:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:39:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:39:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 20:39:24,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:24,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184690044] [2024-11-08 20:39:24,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184690044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:39:24,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837866796] [2024-11-08 20:39:24,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:24,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:39:24,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:39:24,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:39:24,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 20:39:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:24,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 20:39:24,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:39:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2024-11-08 20:39:25,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:39:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 20:39:25,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837866796] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:39:25,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 20:39:25,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2024-11-08 20:39:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932734264] [2024-11-08 20:39:25,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 20:39:25,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 20:39:25,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:25,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 20:39:25,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-08 20:39:25,516 INFO L87 Difference]: Start difference. First operand 266 states and 409 transitions. Second operand has 17 states, 16 states have (on average 7.25) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 7 states have call predecessors, (99), 7 states have call successors, (99) [2024-11-08 20:39:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:26,199 INFO L93 Difference]: Finished difference Result 534 states and 806 transitions. [2024-11-08 20:39:26,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 20:39:26,200 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.25) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 7 states have call predecessors, (99), 7 states have call successors, (99) Word has length 208 [2024-11-08 20:39:26,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:26,203 INFO L225 Difference]: With dead ends: 534 [2024-11-08 20:39:26,203 INFO L226 Difference]: Without dead ends: 343 [2024-11-08 20:39:26,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=530, Unknown=0, NotChecked=0, Total=756 [2024-11-08 20:39:26,204 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 509 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:26,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 676 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 20:39:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-08 20:39:26,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 286. [2024-11-08 20:39:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 178 states have (on average 1.3258426966292134) internal successors, (236), 178 states have internal predecessors, (236), 99 states have call successors, (99), 8 states have call predecessors, (99), 8 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-08 20:39:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 434 transitions. [2024-11-08 20:39:26,239 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 434 transitions. Word has length 208 [2024-11-08 20:39:26,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:26,239 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 434 transitions. [2024-11-08 20:39:26,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.25) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 7 states have call predecessors, (99), 7 states have call successors, (99) [2024-11-08 20:39:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 434 transitions. [2024-11-08 20:39:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:39:26,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:26,242 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:39:26,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 20:39:26,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:39:26,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:26,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash -33501776, now seen corresponding path program 1 times [2024-11-08 20:39:26,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:26,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734833960] [2024-11-08 20:39:26,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:26,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:39:26,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [60392749] [2024-11-08 20:39:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:26,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:39:26,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:39:26,489 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:39:26,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 20:39:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:26,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 20:39:26,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:39:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 1746 trivial. 0 not checked. [2024-11-08 20:39:26,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:39:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:39:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734833960] [2024-11-08 20:39:26,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 20:39:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60392749] [2024-11-08 20:39:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60392749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:26,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:26,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 20:39:26,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413372368] [2024-11-08 20:39:26,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:26,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 20:39:26,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:39:26,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 20:39:26,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:39:26,876 INFO L87 Difference]: Start difference. First operand 286 states and 434 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:39:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:27,284 INFO L93 Difference]: Finished difference Result 736 states and 1108 transitions. [2024-11-08 20:39:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 20:39:27,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 209 [2024-11-08 20:39:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:27,287 INFO L225 Difference]: With dead ends: 736 [2024-11-08 20:39:27,288 INFO L226 Difference]: Without dead ends: 526 [2024-11-08 20:39:27,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-08 20:39:27,290 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 271 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:27,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 523 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:39:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-08 20:39:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 512. [2024-11-08 20:39:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 330 states have (on average 1.3363636363636364) internal successors, (441), 330 states have internal predecessors, (441), 165 states have call successors, (165), 16 states have call predecessors, (165), 16 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-08 20:39:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 771 transitions. [2024-11-08 20:39:27,331 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 771 transitions. Word has length 209 [2024-11-08 20:39:27,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:27,334 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 771 transitions. [2024-11-08 20:39:27,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:39:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 771 transitions. [2024-11-08 20:39:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:39:27,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:27,339 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:39:27,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 20:39:27,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:39:27,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:27,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:27,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1621849678, now seen corresponding path program 1 times [2024-11-08 20:39:27,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:39:27,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247115153] [2024-11-08 20:39:27,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:27,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:39:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:39:27,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836389664] [2024-11-08 20:39:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:27,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:39:27,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:39:27,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:39:27,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 20:39:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:39:27,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:39:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:39:27,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:39:27,841 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:39:27,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:39:27,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 20:39:28,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:39:28,047 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:39:28,141 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:39:28,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:39:28 BoogieIcfgContainer [2024-11-08 20:39:28,144 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:39:28,144 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:39:28,144 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:39:28,144 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:39:28,145 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:20" (3/4) ... [2024-11-08 20:39:28,146 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:39:28,147 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:39:28,147 INFO L158 Benchmark]: Toolchain (without parser) took 8544.54ms. Allocated memory was 186.6MB in the beginning and 318.8MB in the end (delta: 132.1MB). Free memory was 118.5MB in the beginning and 252.5MB in the end (delta: -133.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:39:28,148 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:39:28,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.83ms. Allocated memory is still 186.6MB. Free memory was 118.2MB in the beginning and 102.1MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 20:39:28,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.42ms. Allocated memory is still 186.6MB. Free memory was 102.1MB in the beginning and 99.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:39:28,148 INFO L158 Benchmark]: Boogie Preprocessor took 55.03ms. Allocated memory is still 186.6MB. Free memory was 99.1MB in the beginning and 95.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 20:39:28,148 INFO L158 Benchmark]: RCFGBuilder took 490.33ms. Allocated memory is still 186.6MB. Free memory was 95.8MB in the beginning and 156.6MB in the end (delta: -60.8MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-11-08 20:39:28,149 INFO L158 Benchmark]: TraceAbstraction took 7660.59ms. Allocated memory was 186.6MB in the beginning and 318.8MB in the end (delta: 132.1MB). Free memory was 156.1MB in the beginning and 253.5MB in the end (delta: -97.4MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. [2024-11-08 20:39:28,149 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 318.8MB. Free memory was 253.5MB in the beginning and 252.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:39:28,150 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.13ms. Allocated memory is still 113.2MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.83ms. Allocated memory is still 186.6MB. Free memory was 118.2MB in the beginning and 102.1MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.42ms. Allocated memory is still 186.6MB. Free memory was 102.1MB in the beginning and 99.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.03ms. Allocated memory is still 186.6MB. Free memory was 99.1MB in the beginning and 95.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 490.33ms. Allocated memory is still 186.6MB. Free memory was 95.8MB in the beginning and 156.6MB in the end (delta: -60.8MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7660.59ms. Allocated memory was 186.6MB in the beginning and 318.8MB in the end (delta: 132.1MB). Free memory was 156.1MB in the beginning and 253.5MB in the end (delta: -97.4MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 318.8MB. Free memory was 253.5MB in the beginning and 252.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of shiftRight at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned char var_1_27 = 32; [L41] double var_1_28 = 7.7; [L42] double var_1_29 = 127.8; [L43] unsigned char var_1_30 = 1; [L44] signed long int var_1_31 = -16; [L45] unsigned char var_1_32 = 0; [L46] unsigned short int var_1_33 = 128; [L47] signed short int var_1_34 = 50; [L48] unsigned short int var_1_35 = 10000; [L49] unsigned long int var_1_36 = 128; [L50] signed char var_1_37 = 2; [L51] unsigned short int last_1_var_1_8 = 4; [L52] signed short int last_1_var_1_21 = -64; [L53] signed char last_1_var_1_25 = -128; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L175] last_1_var_1_8 = var_1_8 [L176] last_1_var_1_21 = var_1_21 [L177] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L122] var_1_4 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L123] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L124] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L124] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L125] var_1_6 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_7=0, var_1_8=4] [L126] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_7=0, var_1_8=4] [L127] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L127] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L128] var_1_11 = __VERIFIER_nondet_long() [L129] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L129] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L130] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L130] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L131] var_1_12 = __VERIFIER_nondet_long() [L132] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L132] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L133] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L133] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L134] var_1_13 = __VERIFIER_nondet_ushort() [L135] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L135] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L136] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L136] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L137] var_1_15 = __VERIFIER_nondet_short() [L138] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L138] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L139] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L139] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L140] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L140] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L141] var_1_16 = __VERIFIER_nondet_long() [L142] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L142] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L143] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L143] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L145] var_1_17 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L146] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L147] var_1_18 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L148] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L149] var_1_19 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L150] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L151] var_1_20 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L152] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L153] var_1_26 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L154] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L155] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L155] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L156] var_1_28 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L157] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L158] var_1_29 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L159] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L160] var_1_31 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_31 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L161] RET assume_abort_if_not(var_1_31 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L162] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L162] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L163] var_1_32 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L164] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L165] CALL assume_abort_if_not(var_1_32 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L165] RET assume_abort_if_not(var_1_32 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L166] var_1_34 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L167] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L168] CALL assume_abort_if_not(var_1_34 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L168] RET assume_abort_if_not(var_1_34 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L169] var_1_37 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_37 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L170] RET assume_abort_if_not(var_1_37 >= -128) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L171] CALL assume_abort_if_not(var_1_37 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L171] RET assume_abort_if_not(var_1_37 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] CALL assume_abort_if_not(var_1_37 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] RET assume_abort_if_not(var_1_37 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L188] RET updateVariables() [L189] CALL step() [L57] COND FALSE !(0.75 <= var_1_28) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L62] COND TRUE (~ var_1_27) < var_1_31 [L63] var_1_30 = var_1_32 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L65] COND FALSE !(\read(var_1_32)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L76] var_1_35 = var_1_27 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L77] COND FALSE !((-1 / var_1_37) >= ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L80] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L80] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L81] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L85] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L86] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L87] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L92] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L94] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L95] COND TRUE \read(var_1_4) [L96] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L99] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L106] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L108] COND TRUE (- var_1_14) <= var_1_14 [L109] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L117] COND FALSE !(var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L189] RET step() [L190] CALL, EXPR property() [L180] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L180-L181] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 7, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1358 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1298 mSDsluCounter, 2646 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1842 mSDsCounter, 579 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1645 IncrementalHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 579 mSolverCounterUnsat, 804 mSDtfsCounter, 1645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1450 GetRequests, 1391 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=512occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 203 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2290 NumberOfCodeBlocks, 2290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2069 ConstructedInterpolants, 0 QuantifiedInterpolants, 6784 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1409 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 20652/21120 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-08 20:39:28,175 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_ps-cn-25_file-38.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 c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:39:29,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:39:29,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:39:29,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:39:29,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:39:29,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:39:29,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:39:29,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:39:29,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:39:29,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:39:29,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:39:29,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:39:29,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:39:29,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:39:29,970 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:39:29,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:39:29,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:39:29,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:39:29,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:39:29,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:39:29,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:39:29,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:39:29,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:39:29,975 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:39:29,975 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:39:29,975 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:39:29,976 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:39:29,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:39:29,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:39:29,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:39:29,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:39:29,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:39:29,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:39:29,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:39:29,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:39:29,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:39:29,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:39:29,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:39:29,977 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:39:29,978 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:39:29,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:39:29,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:39:29,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:39:29,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:39:29,979 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 -> c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f [2024-11-08 20:39:30,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:39:30,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:39:30,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:39:30,264 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:39:30,264 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:39:30,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-11-08 20:39:31,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:39:31,665 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:39:31,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-11-08 20:39:31,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1592e23fd/b0080c7c19c64b9f8abca3920c870e57/FLAG250e83e0c [2024-11-08 20:39:31,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1592e23fd/b0080c7c19c64b9f8abca3920c870e57 [2024-11-08 20:39:31,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:39:31,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:39:31,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:39:31,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:39:31,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:39:31,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:39:31" (1/1) ... [2024-11-08 20:39:31,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7581972f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:31, skipping insertion in model container [2024-11-08 20:39:31,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:39:31" (1/1) ... [2024-11-08 20:39:31,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:39:31,882 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i[915,928] [2024-11-08 20:39:31,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:39:31,953 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:39:31,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i[915,928] [2024-11-08 20:39:31,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:39:32,010 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:39:32,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32 WrapperNode [2024-11-08 20:39:32,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:39:32,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:39:32,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:39:32,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:39:32,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,068 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-08 20:39:32,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:39:32,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:39:32,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:39:32,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:39:32,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,103 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-08 20:39:32,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:39:32,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:39:32,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:39:32,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:39:32,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (1/1) ... [2024-11-08 20:39:32,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:39:32,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:39:32,161 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-08 20:39:32,166 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-08 20:39:32,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:39:32,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:39:32,199 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:39:32,200 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:39:32,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:39:32,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:39:32,280 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:39:32,282 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:39:37,043 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 20:39:37,044 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:39:37,054 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:39:37,055 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:39:37,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:37 BoogieIcfgContainer [2024-11-08 20:39:37,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:39:37,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:39:37,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:39:37,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:39:37,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:39:31" (1/3) ... [2024-11-08 20:39:37,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2ae7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:39:37, skipping insertion in model container [2024-11-08 20:39:37,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:39:32" (2/3) ... [2024-11-08 20:39:37,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2ae7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:39:37, skipping insertion in model container [2024-11-08 20:39:37,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:39:37" (3/3) ... [2024-11-08 20:39:37,061 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-38.i [2024-11-08 20:39:37,073 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:39:37,073 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:39:37,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:39:37,131 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;@4e1ca594, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:39:37,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:39:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:39:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 20:39:37,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:37,149 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:39:37,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:37,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:37,155 INFO L85 PathProgramCache]: Analyzing trace with hash -73127337, now seen corresponding path program 1 times [2024-11-08 20:39:37,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:39:37,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524837589] [2024-11-08 20:39:37,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:37,165 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-08 20:39:37,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:39:37,168 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-08 20:39:37,168 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-08 20:39:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:37,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:39:37,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:39:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2024-11-08 20:39:37,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:39:37,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:39:37,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524837589] [2024-11-08 20:39:37,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524837589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:37,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:37,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:39:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429305075] [2024-11-08 20:39:37,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:37,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:39:37,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:39:37,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:39:37,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:39:37,713 INFO L87 Difference]: Start difference. First operand has 89 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:39:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:37,738 INFO L93 Difference]: Finished difference Result 171 states and 309 transitions. [2024-11-08 20:39:37,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:39:37,740 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2024-11-08 20:39:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:37,745 INFO L225 Difference]: With dead ends: 171 [2024-11-08 20:39:37,746 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 20:39:37,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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-08 20:39:37,754 INFO L432 NwaCegarLoop]: 133 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, 133 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-08 20:39:37,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:39:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 20:39:37,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-08 20:39:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:39:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 133 transitions. [2024-11-08 20:39:37,790 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 133 transitions. Word has length 204 [2024-11-08 20:39:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:37,790 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 133 transitions. [2024-11-08 20:39:37,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:39:37,791 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 133 transitions. [2024-11-08 20:39:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 20:39:37,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:37,794 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:39:37,816 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-08 20:39:37,998 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-08 20:39:37,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:38,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash 947424527, now seen corresponding path program 1 times [2024-11-08 20:39:38,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:39:38,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127773786] [2024-11-08 20:39:38,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:38,003 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-08 20:39:38,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:39:38,005 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-08 20:39:38,006 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-08 20:39:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:38,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 20:39:38,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:39:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:39:39,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:39:39,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:39:39,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127773786] [2024-11-08 20:39:39,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127773786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:39:39,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:39:39,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:39:39,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729901657] [2024-11-08 20:39:39,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:39:39,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:39:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:39:39,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:39:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:39:39,793 INFO L87 Difference]: Start difference. First operand 85 states and 133 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:43,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:39:47,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:39:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:39:47,134 INFO L93 Difference]: Finished difference Result 392 states and 619 transitions. [2024-11-08 20:39:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:39:47,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2024-11-08 20:39:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:39:47,144 INFO L225 Difference]: With dead ends: 392 [2024-11-08 20:39:47,144 INFO L226 Difference]: Without dead ends: 310 [2024-11-08 20:39:47,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:39:47,145 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 225 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:39:47,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 732 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-08 20:39:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-08 20:39:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 165. [2024-11-08 20:39:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 96 states have (on average 1.34375) internal successors, (129), 96 states have internal predecessors, (129), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 20:39:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 261 transitions. [2024-11-08 20:39:47,190 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 261 transitions. Word has length 204 [2024-11-08 20:39:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:39:47,191 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 261 transitions. [2024-11-08 20:39:47,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:39:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 261 transitions. [2024-11-08 20:39:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 20:39:47,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:39:47,196 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:39:47,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 20:39:47,397 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-08 20:39:47,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:39:47,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:39:47,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1743393936, now seen corresponding path program 1 times [2024-11-08 20:39:47,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:39:47,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831699801] [2024-11-08 20:39:47,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:39:47,399 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-08 20:39:47,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:39:47,404 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-08 20:39:47,407 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-08 20:39:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:39:47,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 20:39:47,802 INFO L278 TraceCheckSpWp]: Computing forward predicates...