./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.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_fillercodestructure_filler-ps-ci_file-79.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 dba54f3464e88b90946abdccde2d7a055f54d4b2bf456cd41e3bbaa9f8dc4f14 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:19:50,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:19:51,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:19:51,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:19:51,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:19:51,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:19:51,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:19:51,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:19:51,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:19:51,068 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:19:51,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:19:51,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:19:51,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:19:51,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:19:51,070 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:19:51,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:19:51,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:19:51,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:19:51,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:19:51,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:19:51,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:19:51,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:19:51,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:19:51,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:19:51,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:19:51,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:19:51,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:19:51,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:19:51,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:19:51,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:19:51,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:19:51,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:19:51,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:19:51,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:19:51,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:19:51,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:19:51,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:19:51,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:19:51,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:19:51,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:19:51,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:19:51,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:19:51,083 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 -> dba54f3464e88b90946abdccde2d7a055f54d4b2bf456cd41e3bbaa9f8dc4f14 [2024-11-08 22:19:51,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:19:51,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:19:51,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:19:51,395 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:19:51,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:19:51,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2024-11-08 22:19:52,945 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:19:53,203 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:19:53,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2024-11-08 22:19:53,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef27d70c9/98237dd1f6e0472a9699c7d04c6421f6/FLAG9cd88b374 [2024-11-08 22:19:53,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef27d70c9/98237dd1f6e0472a9699c7d04c6421f6 [2024-11-08 22:19:53,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:19:53,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:19:53,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:19:53,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:19:53,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:19:53,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:19:53" (1/1) ... [2024-11-08 22:19:53,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b907054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:53, skipping insertion in model container [2024-11-08 22:19:53,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:19:53" (1/1) ... [2024-11-08 22:19:53,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:19:53,787 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_fillercodestructure_filler-ps-ci_file-79.i[919,932] [2024-11-08 22:19:53,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:19:53,941 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:19:53,954 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_fillercodestructure_filler-ps-ci_file-79.i[919,932] [2024-11-08 22:19:54,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:19:54,030 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:19:54,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54 WrapperNode [2024-11-08 22:19:54,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:19:54,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:19:54,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:19:54,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:19:54,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (1/1) ... [2024-11-08 22:19:54,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (1/1) ... [2024-11-08 22:19:54,121 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-11-08 22:19:54,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:19:54,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:19:54,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:19:54,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:19:54,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (1/1) ... [2024-11-08 22:19:54,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (1/1) ... [2024-11-08 22:19:54,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (1/1) ... [2024-11-08 22:19:54,175 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 22:19:54,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (1/1) ... [2024-11-08 22:19:54,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (1/1) ... [2024-11-08 22:19:54,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (1/1) ... [2024-11-08 22:19:54,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (1/1) ... [2024-11-08 22:19:54,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (1/1) ... [2024-11-08 22:19:54,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (1/1) ... [2024-11-08 22:19:54,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:19:54,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:19:54,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:19:54,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:19:54,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (1/1) ... [2024-11-08 22:19:54,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:19:54,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:19:54,259 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 22:19:54,264 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 22:19:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:19:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:19:54,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:19:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:19:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:19:54,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:19:54,435 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:19:54,438 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:19:54,961 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 22:19:54,962 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:19:54,977 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:19:54,977 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:19:54,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:19:54 BoogieIcfgContainer [2024-11-08 22:19:54,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:19:54,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:19:54,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:19:54,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:19:54,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:19:53" (1/3) ... [2024-11-08 22:19:54,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b435fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:19:54, skipping insertion in model container [2024-11-08 22:19:54,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:19:54" (2/3) ... [2024-11-08 22:19:54,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b435fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:19:54, skipping insertion in model container [2024-11-08 22:19:54,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:19:54" (3/3) ... [2024-11-08 22:19:54,990 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2024-11-08 22:19:55,020 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:19:55,020 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:19:55,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:19:55,104 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;@7da05c88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:19:55,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:19:55,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:19:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 22:19:55,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:19:55,128 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:55,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:19:55,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:19:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1226442125, now seen corresponding path program 1 times [2024-11-08 22:19:55,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:19:55,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528064526] [2024-11-08 22:19:55,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:19:55,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:19:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:19:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:19:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:19:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:19:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:19:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:19:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:19:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:19:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:19:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:19:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:19:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 22:19:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 22:19:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 22:19:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 22:19:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:19:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 22:19:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:19:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 22:19:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:19:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 22:19:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 22:19:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:19:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:19:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 22:19:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:19:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:19:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:19:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:19:55,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:19:55,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528064526] [2024-11-08 22:19:55,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528064526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:19:55,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:19:55,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:19:55,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51840971] [2024-11-08 22:19:55,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:19:55,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:19:55,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:19:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:19:55,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:19:55,802 INFO L87 Difference]: Start difference. First operand has 90 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 22:19:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:19:55,895 INFO L93 Difference]: Finished difference Result 173 states and 302 transitions. [2024-11-08 22:19:55,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:19:55,897 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2024-11-08 22:19:55,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:19:55,909 INFO L225 Difference]: With dead ends: 173 [2024-11-08 22:19:55,909 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 22:19:55,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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 22:19:55,921 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 22:19:55,922 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 22:19:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 22:19:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-08 22:19:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:19:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-11-08 22:19:55,995 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 183 [2024-11-08 22:19:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:19:55,996 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-11-08 22:19:55,996 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 22:19:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-11-08 22:19:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 22:19:56,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:19:56,004 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:56,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:19:56,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:19:56,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:19:56,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1040811773, now seen corresponding path program 1 times [2024-11-08 22:19:56,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:19:56,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904218125] [2024-11-08 22:19:56,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:19:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:19:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:19:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:19:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:19:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:19:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:19:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:19:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:19:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:19:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:19:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:19:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:19:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 22:19:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 22:19:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 22:19:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 22:19:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:19:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 22:19:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:19:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 22:19:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:19:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 22:19:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 22:19:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:19:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:19:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 22:19:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:19:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:19:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:19:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:19:56,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:19:56,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904218125] [2024-11-08 22:19:56,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904218125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:19:56,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:19:56,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:19:56,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435259552] [2024-11-08 22:19:56,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:19:56,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:19:56,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:19:56,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:19:56,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:19:56,439 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:19:56,480 INFO L93 Difference]: Finished difference Result 169 states and 263 transitions. [2024-11-08 22:19:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:19:56,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-08 22:19:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:19:56,485 INFO L225 Difference]: With dead ends: 169 [2024-11-08 22:19:56,487 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 22:19:56,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:19:56,491 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:19:56,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:19:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 22:19:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-08 22:19:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:19:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2024-11-08 22:19:56,510 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 183 [2024-11-08 22:19:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:19:56,513 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2024-11-08 22:19:56,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:56,514 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2024-11-08 22:19:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 22:19:56,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:19:56,517 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:56,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:19:56,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:19:56,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:19:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash 547536129, now seen corresponding path program 1 times [2024-11-08 22:19:56,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:19:56,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156063791] [2024-11-08 22:19:56,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:19:56,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:19:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:19:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:19:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:19:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:19:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:19:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:19:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:19:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:19:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:19:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:19:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:19:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 22:19:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 22:19:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 22:19:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 22:19:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:19:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 22:19:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:19:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 22:19:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:19:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 22:19:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:56,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 22:19:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:19:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:19:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 22:19:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:19:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:19:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:19:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:19:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:19:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156063791] [2024-11-08 22:19:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156063791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:19:57,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:19:57,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:19:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195740106] [2024-11-08 22:19:57,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:19:57,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:19:57,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:19:57,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:19:57,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:19:57,044 INFO L87 Difference]: Start difference. First operand 86 states and 132 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:19:57,102 INFO L93 Difference]: Finished difference Result 252 states and 390 transitions. [2024-11-08 22:19:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:19:57,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-08 22:19:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:19:57,106 INFO L225 Difference]: With dead ends: 252 [2024-11-08 22:19:57,107 INFO L226 Difference]: Without dead ends: 169 [2024-11-08 22:19:57,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:19:57,108 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 64 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:19:57,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 250 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:19:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-08 22:19:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-11-08 22:19:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 108 states have internal predecessors, (146), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 22:19:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 258 transitions. [2024-11-08 22:19:57,137 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 258 transitions. Word has length 183 [2024-11-08 22:19:57,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:19:57,138 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 258 transitions. [2024-11-08 22:19:57,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 258 transitions. [2024-11-08 22:19:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 22:19:57,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:19:57,141 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:57,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:19:57,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:19:57,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:19:57,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1079495485, now seen corresponding path program 1 times [2024-11-08 22:19:57,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:19:57,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527906110] [2024-11-08 22:19:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:19:57,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:19:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:19:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:19:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:19:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:19:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:19:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:19:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:19:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:19:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:19:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:19:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:19:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 22:19:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 22:19:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 22:19:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 22:19:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:19:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 22:19:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:19:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 22:19:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:19:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 22:19:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 22:19:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:19:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:19:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 22:19:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:19:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:19:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:19:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:19:57,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:19:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527906110] [2024-11-08 22:19:57,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527906110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:19:57,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:19:57,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:19:57,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475197994] [2024-11-08 22:19:57,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:19:57,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:19:57,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:19:57,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:19:57,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:19:57,637 INFO L87 Difference]: Start difference. First operand 167 states and 258 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:19:57,898 INFO L93 Difference]: Finished difference Result 347 states and 534 transitions. [2024-11-08 22:19:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:19:57,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2024-11-08 22:19:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:19:57,904 INFO L225 Difference]: With dead ends: 347 [2024-11-08 22:19:57,904 INFO L226 Difference]: Without dead ends: 183 [2024-11-08 22:19:57,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:19:57,909 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 131 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:19:57,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 440 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:19:57,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-08 22:19:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2024-11-08 22:19:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 108 states have (on average 1.3425925925925926) internal successors, (145), 108 states have internal predecessors, (145), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 22:19:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 257 transitions. [2024-11-08 22:19:57,949 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 257 transitions. Word has length 184 [2024-11-08 22:19:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:19:57,951 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 257 transitions. [2024-11-08 22:19:57,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 257 transitions. [2024-11-08 22:19:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 22:19:57,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:19:57,955 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:57,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:19:57,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:19:57,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:19:57,955 INFO L85 PathProgramCache]: Analyzing trace with hash -47544188, now seen corresponding path program 1 times [2024-11-08 22:19:57,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:19:57,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982622391] [2024-11-08 22:19:57,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:19:57,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:19:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:19:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:19:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:19:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:19:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:19:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:19:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:19:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:19:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:19:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:19:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:19:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 22:19:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 22:19:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 22:19:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 22:19:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:19:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 22:19:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:19:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 22:19:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:19:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 22:19:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 22:19:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:19:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:19:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 22:19:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:19:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:19:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:19:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:19:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:19:58,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982622391] [2024-11-08 22:19:58,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982622391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:19:58,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:19:58,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:19:58,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266425813] [2024-11-08 22:19:58,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:19:58,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:19:58,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:19:58,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:19:58,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:19:58,218 INFO L87 Difference]: Start difference. First operand 167 states and 257 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:19:58,247 INFO L93 Difference]: Finished difference Result 341 states and 529 transitions. [2024-11-08 22:19:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:19:58,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-11-08 22:19:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:19:58,250 INFO L225 Difference]: With dead ends: 341 [2024-11-08 22:19:58,250 INFO L226 Difference]: Without dead ends: 177 [2024-11-08 22:19:58,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:19:58,255 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 18 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:19:58,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 271 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:19:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-08 22:19:58,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 167. [2024-11-08 22:19:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 108 states have internal predecessors, (143), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 22:19:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 255 transitions. [2024-11-08 22:19:58,287 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 255 transitions. Word has length 185 [2024-11-08 22:19:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:19:58,287 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 255 transitions. [2024-11-08 22:19:58,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 255 transitions. [2024-11-08 22:19:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 22:19:58,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:19:58,290 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:58,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:19:58,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:19:58,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:19:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash 210621250, now seen corresponding path program 1 times [2024-11-08 22:19:58,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:19:58,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875618635] [2024-11-08 22:19:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:19:58,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:19:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:19:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:19:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:19:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:19:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:19:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:19:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:19:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:19:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:19:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:19:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:19:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 22:19:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 22:19:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 22:19:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 22:19:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:19:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 22:19:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:19:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 22:19:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:19:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 22:19:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 22:19:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:19:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:19:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 22:19:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:19:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:19:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:19:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:19:58,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:19:58,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875618635] [2024-11-08 22:19:58,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875618635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:19:58,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:19:58,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:19:58,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479407604] [2024-11-08 22:19:58,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:19:58,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:19:58,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:19:58,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:19:58,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:19:58,942 INFO L87 Difference]: Start difference. First operand 167 states and 255 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:19:59,248 INFO L93 Difference]: Finished difference Result 400 states and 613 transitions. [2024-11-08 22:19:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:19:59,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-11-08 22:19:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:19:59,252 INFO L225 Difference]: With dead ends: 400 [2024-11-08 22:19:59,254 INFO L226 Difference]: Without dead ends: 236 [2024-11-08 22:19:59,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:19:59,256 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:19:59,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 270 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:19:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-08 22:19:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 228. [2024-11-08 22:19:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-08 22:19:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 347 transitions. [2024-11-08 22:19:59,292 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 347 transitions. Word has length 185 [2024-11-08 22:19:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:19:59,294 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 347 transitions. [2024-11-08 22:19:59,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 347 transitions. [2024-11-08 22:19:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 22:19:59,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:19:59,297 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:59,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:19:59,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:19:59,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:19:59,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1185742294, now seen corresponding path program 1 times [2024-11-08 22:19:59,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:19:59,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034574260] [2024-11-08 22:19:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:19:59,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:19:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:19:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:19:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:19:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:19:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:19:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:19:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:19:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:19:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:19:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:19:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:19:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 22:19:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 22:19:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 22:19:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 22:19:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:19:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 22:19:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:19:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 22:19:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:19:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 22:19:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 22:19:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:19:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:19:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 22:19:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:19:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:19:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:19:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:19:59,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:19:59,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034574260] [2024-11-08 22:19:59,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034574260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:19:59,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:19:59,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:19:59,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61146896] [2024-11-08 22:19:59,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:19:59,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:19:59,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:19:59,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:19:59,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:19:59,456 INFO L87 Difference]: Start difference. First operand 228 states and 347 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:19:59,510 INFO L93 Difference]: Finished difference Result 521 states and 794 transitions. [2024-11-08 22:19:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:19:59,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-08 22:19:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:19:59,514 INFO L225 Difference]: With dead ends: 521 [2024-11-08 22:19:59,515 INFO L226 Difference]: Without dead ends: 356 [2024-11-08 22:19:59,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:19:59,516 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 89 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:19:59,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 302 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:19:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-08 22:19:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2024-11-08 22:19:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 224 states have (on average 1.2901785714285714) internal successors, (289), 226 states have internal predecessors, (289), 122 states have call successors, (122), 5 states have call predecessors, (122), 5 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2024-11-08 22:19:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 533 transitions. [2024-11-08 22:19:59,567 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 533 transitions. Word has length 186 [2024-11-08 22:19:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:19:59,570 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 533 transitions. [2024-11-08 22:19:59,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 533 transitions. [2024-11-08 22:19:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 22:19:59,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:19:59,572 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:59,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:19:59,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:19:59,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:19:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2088156648, now seen corresponding path program 1 times [2024-11-08 22:19:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:19:59,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106725432] [2024-11-08 22:19:59,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:19:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:19:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:19:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:19:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:19:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:19:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:19:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:19:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:19:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:19:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:19:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:19:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 22:19:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 22:19:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 22:19:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 22:19:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 22:19:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:19:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 22:19:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:19:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 22:19:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:19:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 22:19:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 22:19:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:19:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:19:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 22:19:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:19:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:19:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:19:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:19:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:19:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:19:59,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106725432] [2024-11-08 22:19:59,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106725432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:19:59,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:19:59,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:19:59,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943335260] [2024-11-08 22:19:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:19:59,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:19:59,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:19:59,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:19:59,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:19:59,859 INFO L87 Difference]: Start difference. First operand 352 states and 533 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:19:59,912 INFO L93 Difference]: Finished difference Result 652 states and 978 transitions. [2024-11-08 22:19:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:19:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-08 22:19:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:19:59,916 INFO L225 Difference]: With dead ends: 652 [2024-11-08 22:19:59,917 INFO L226 Difference]: Without dead ends: 368 [2024-11-08 22:19:59,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:19:59,919 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 33 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:19:59,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 235 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:19:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-08 22:19:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-08 22:19:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 236 states have (on average 1.2584745762711864) internal successors, (297), 238 states have internal predecessors, (297), 122 states have call successors, (122), 9 states have call predecessors, (122), 9 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2024-11-08 22:19:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 541 transitions. [2024-11-08 22:19:59,962 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 541 transitions. Word has length 186 [2024-11-08 22:19:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:19:59,963 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 541 transitions. [2024-11-08 22:19:59,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:19:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 541 transitions. [2024-11-08 22:19:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 22:19:59,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:19:59,966 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:59,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 22:19:59,967 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:19:59,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:19:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1264022246, now seen corresponding path program 1 times [2024-11-08 22:19:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:19:59,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972520679] [2024-11-08 22:19:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:19:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:20:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:20:00,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819414597] [2024-11-08 22:20:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:20:00,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:20:00,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:20:00,084 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 22:20:00,086 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 22:20:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:20:00,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:20:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:20:00,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:20:00,630 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:20:00,632 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:20:00,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:20:00,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:20:00,840 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:20:00,984 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:20:00,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:20:00 BoogieIcfgContainer [2024-11-08 22:20:00,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:20:00,988 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:20:00,988 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:20:00,988 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:20:00,989 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:19:54" (3/4) ... [2024-11-08 22:20:00,991 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:20:00,993 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:20:00,993 INFO L158 Benchmark]: Toolchain (without parser) took 7462.96ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 134.9MB in the beginning and 155.9MB in the end (delta: -21.1MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2024-11-08 22:20:00,993 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 134.2MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:20:00,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.82ms. Allocated memory is still 163.6MB. Free memory was 134.9MB in the beginning and 116.7MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 22:20:00,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.44ms. Allocated memory is still 163.6MB. Free memory was 116.7MB in the beginning and 111.1MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:20:00,994 INFO L158 Benchmark]: Boogie Preprocessor took 93.92ms. Allocated memory is still 163.6MB. Free memory was 111.1MB in the beginning and 102.0MB in the end (delta: 9.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:20:00,995 INFO L158 Benchmark]: RCFGBuilder took 761.44ms. Allocated memory is still 163.6MB. Free memory was 102.0MB in the beginning and 125.5MB in the end (delta: -23.5MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2024-11-08 22:20:00,995 INFO L158 Benchmark]: TraceAbstraction took 6006.14ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 124.5MB in the beginning and 155.9MB in the end (delta: -31.5MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2024-11-08 22:20:00,995 INFO L158 Benchmark]: Witness Printer took 4.91ms. Allocated memory is still 237.0MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:20:00,997 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.32ms. Allocated memory is still 134.2MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.82ms. Allocated memory is still 163.6MB. Free memory was 134.9MB in the beginning and 116.7MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.44ms. Allocated memory is still 163.6MB. Free memory was 116.7MB in the beginning and 111.1MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.92ms. Allocated memory is still 163.6MB. Free memory was 111.1MB in the beginning and 102.0MB in the end (delta: 9.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 761.44ms. Allocated memory is still 163.6MB. Free memory was 102.0MB in the beginning and 125.5MB in the end (delta: -23.5MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6006.14ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 124.5MB in the beginning and 155.9MB in the end (delta: -31.5MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * Witness Printer took 4.91ms. Allocated memory is still 237.0MB. Free memory is still 155.9MB. 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 192, overapproximation of someBinaryFLOATComparisonOperation at line 192, overapproximation of someBinaryArithmeticDOUBLEoperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 50; [L26] unsigned char var_1_8 = 0; [L27] double var_1_9 = 127.625; [L28] double var_1_10 = 256.8; [L29] double var_1_11 = 0.30000000000000004; [L30] signed long int var_1_12 = -2; [L31] double var_1_13 = 2.475; [L32] double var_1_14 = 25.2; [L33] double var_1_15 = 500.125; [L34] double var_1_16 = 10.75; [L35] double var_1_17 = 255.4; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 100; [L39] unsigned char var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] unsigned char var_1_24 = 8; [L43] unsigned char var_1_25 = 10; [L44] float var_1_26 = 16.8; [L45] unsigned long int var_1_27 = 64; [L46] unsigned long int var_1_28 = 256; [L47] double var_1_32 = 255.5; [L48] signed long int var_1_36 = 4; [L49] double var_1_38 = 63.6; [L50] double var_1_40 = 0.0; [L51] signed short int var_1_42 = 128; [L52] unsigned char var_1_45 = 0; [L53] unsigned char var_1_48 = 0; [L54] float var_1_49 = 256.5; [L55] unsigned long int var_1_50 = 100; [L56] double var_1_51 = 63.5; [L57] unsigned char var_1_52 = 50; [L58] unsigned char last_1_var_1_18 = 1; [L59] unsigned char last_1_var_1_20 = 100; VAL [isInitial=0, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L196] isInitial = 1 [L197] FCALL initially() [L198] COND TRUE 1 [L199] CALL updateLastVariables() [L188] last_1_var_1_18 = var_1_18 [L189] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L199] RET updateLastVariables() [L200] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L145] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L145] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L148] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L148] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L149] var_1_10 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L150] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L151] var_1_11 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L152] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L153] var_1_13 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L154] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L155] var_1_14 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L156] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L157] var_1_15 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L158] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L159] var_1_16 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L160] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L161] var_1_17 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L162] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L163] var_1_19 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L164] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L165] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L165] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L166] var_1_21 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L167] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L168] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L168] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L169] var_1_22 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L170] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L171] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L171] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L172] var_1_23 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L173] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L174] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L174] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L175] var_1_24 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L176] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L177] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L177] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L178] var_1_25 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L179] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L180] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L180] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L181] var_1_40 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_40 >= 4611686.018427382800e+12F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L182] RET assume_abort_if_not((var_1_40 >= 4611686.018427382800e+12F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L183] var_1_48 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_48 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L184] RET assume_abort_if_not(var_1_48 >= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L185] CALL assume_abort_if_not(var_1_48 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L185] RET assume_abort_if_not(var_1_48 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L200] RET updateVariables() [L201] CALL step() [L63] COND TRUE (var_1_21 - var_1_22) <= var_1_25 [L64] var_1_28 = var_1_22 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=64, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L66] var_1_32 = ((((((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16)))) > (var_1_10)) ? (((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16)))) : (var_1_10))) [L67] var_1_36 = (((((var_1_7) > (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_7) : (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))) + var_1_7) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L68] EXPR -10 >> var_1_23 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L68] COND TRUE 256 > (-10 >> var_1_23) [L69] var_1_38 = (var_1_16 - (((((var_1_40 - 128.375)) < (var_1_16)) ? ((var_1_40 - 128.375)) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L73] COND TRUE ! (var_1_17 >= (var_1_16 - var_1_40)) [L74] var_1_42 = (((((var_1_7 - 256)) < (var_1_20)) ? ((var_1_7 - 256)) : (var_1_20))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L76] EXPR (var_1_8 * var_1_23) | var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L76] COND TRUE ((var_1_8 * var_1_23) | var_1_7) <= (var_1_20 + 8u) [L77] COND FALSE !(((((16u) < (var_1_20)) ? (16u) : (var_1_20))) < var_1_23) [L80] var_1_45 = ((var_1_23 != (var_1_20 % var_1_21)) || var_1_48) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L83] COND FALSE !(0.83f > var_1_11) [L88] var_1_49 = var_1_11 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L90] var_1_50 = var_1_7 [L91] var_1_51 = var_1_16 [L92] var_1_52 = var_1_8 [L93] signed long int stepLocal_1 = last_1_var_1_20; [L94] unsigned char stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_0=1, stepLocal_1=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L95] COND TRUE stepLocal_0 && last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_1=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=50, var_1_8=4, var_1_9=1021/8] [L96] COND FALSE !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > stepLocal_1) [L99] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=4, var_1_8=4, var_1_9=1021/8] [L104] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=4, var_1_8=4, var_1_9=1021/8] [L109] var_1_26 = var_1_16 [L110] var_1_27 = 10u [L111] unsigned long int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_2=10, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=3, var_1_27=10, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=4, var_1_8=4, var_1_9=1021/8] [L112] COND TRUE stepLocal_2 != (var_1_8 + var_1_7) [L113] var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=3, var_1_27=10, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=4, var_1_8=4, var_1_9=4] [L117] COND TRUE var_1_8 >= var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=3, var_1_27=10, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=4, var_1_8=4, var_1_9=4] [L118] COND TRUE var_1_15 >= var_1_26 [L119] var_1_20 = (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=3, var_1_27=10, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=4, var_1_8=4, var_1_9=4] [L126] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=3, var_1_27=10, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=4, var_1_8=4, var_1_9=4] [L127] COND FALSE !(! var_1_18) [L130] var_1_1 = (var_1_20 - var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=64, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=3, var_1_27=10, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=4, var_1_8=4, var_1_9=4] [L135] COND TRUE (var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17)) [L136] var_1_12 = (var_1_20 + var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=128, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=64, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=3, var_1_27=10, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=4, var_1_8=4, var_1_9=4] [L201] RET step() [L202] CALL, EXPR property() [L192-L193] return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u)) ; VAL [\result=0, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=128, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=64, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=3, var_1_27=10, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=4, var_1_8=4, var_1_9=4] [L202] RET, EXPR property() [L202] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=128, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=64, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=3, var_1_27=10, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=4, var_1_8=4, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=128, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=64, var_1_21=383, var_1_22=64, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=3, var_1_27=10, var_1_28=64, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=4, var_1_7=4, var_1_8=4, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 2159 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1050 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 258 IncrementalHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 1109 mSDtfsCounter, 258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 509 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=8, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1849 NumberOfCodeBlocks, 1849 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1467 ConstructedInterpolants, 0 QuantifiedInterpolants, 2437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 12096/12096 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 22:20:01,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.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 dba54f3464e88b90946abdccde2d7a055f54d4b2bf456cd41e3bbaa9f8dc4f14 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:20:03,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:20:03,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:20:03,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:20:03,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:20:03,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:20:03,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:20:03,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:20:03,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:20:03,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:20:03,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:20:03,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:20:03,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:20:03,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:20:03,457 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:20:03,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:20:03,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:20:03,461 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:20:03,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:20:03,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:20:03,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:20:03,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:20:03,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:20:03,463 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:20:03,463 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:20:03,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:20:03,464 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:20:03,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:20:03,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:20:03,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:20:03,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:20:03,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:20:03,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:20:03,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:20:03,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:20:03,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:20:03,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:20:03,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:20:03,467 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:20:03,467 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:20:03,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:20:03,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:20:03,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:20:03,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:20:03,469 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 -> dba54f3464e88b90946abdccde2d7a055f54d4b2bf456cd41e3bbaa9f8dc4f14 [2024-11-08 22:20:03,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:20:03,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:20:03,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:20:03,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:20:03,857 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:20:03,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2024-11-08 22:20:05,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:20:05,557 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:20:05,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2024-11-08 22:20:05,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0be6539/201510e4cbcb41e2b01649cb638ebafb/FLAGe5314b09e [2024-11-08 22:20:05,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0be6539/201510e4cbcb41e2b01649cb638ebafb [2024-11-08 22:20:05,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:20:05,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:20:05,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:20:05,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:20:05,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:20:05,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:20:05" (1/1) ... [2024-11-08 22:20:05,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2322ec21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:05, skipping insertion in model container [2024-11-08 22:20:05,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:20:05" (1/1) ... [2024-11-08 22:20:05,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:20:05,832 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_fillercodestructure_filler-ps-ci_file-79.i[919,932] [2024-11-08 22:20:05,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:20:05,965 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:20:05,981 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_fillercodestructure_filler-ps-ci_file-79.i[919,932] [2024-11-08 22:20:06,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:20:06,072 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:20:06,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06 WrapperNode [2024-11-08 22:20:06,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:20:06,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:20:06,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:20:06,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:20:06,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (1/1) ... [2024-11-08 22:20:06,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (1/1) ... [2024-11-08 22:20:06,164 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-08 22:20:06,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:20:06,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:20:06,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:20:06,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:20:06,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (1/1) ... [2024-11-08 22:20:06,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (1/1) ... [2024-11-08 22:20:06,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (1/1) ... [2024-11-08 22:20:06,223 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:20:06,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (1/1) ... [2024-11-08 22:20:06,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (1/1) ... [2024-11-08 22:20:06,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (1/1) ... [2024-11-08 22:20:06,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (1/1) ... [2024-11-08 22:20:06,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (1/1) ... [2024-11-08 22:20:06,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (1/1) ... [2024-11-08 22:20:06,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:20:06,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:20:06,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:20:06,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:20:06,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (1/1) ... [2024-11-08 22:20:06,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:20:06,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:20:06,310 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 22:20:06,313 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 22:20:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:20:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:20:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:20:06,370 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:20:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:20:06,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:20:06,506 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:20:06,509 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:20:15,459 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 22:20:15,459 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:20:15,480 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:20:15,481 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:20:15,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:20:15 BoogieIcfgContainer [2024-11-08 22:20:15,482 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:20:15,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:20:15,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:20:15,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:20:15,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:20:05" (1/3) ... [2024-11-08 22:20:15,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b0253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:20:15, skipping insertion in model container [2024-11-08 22:20:15,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:20:06" (2/3) ... [2024-11-08 22:20:15,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b0253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:20:15, skipping insertion in model container [2024-11-08 22:20:15,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:20:15" (3/3) ... [2024-11-08 22:20:15,490 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2024-11-08 22:20:15,507 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:20:15,507 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:20:15,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:20:15,580 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;@362ff7a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:20:15,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:20:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:20:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-08 22:20:15,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:20:15,604 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:20:15,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:20:15,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:20:15,610 INFO L85 PathProgramCache]: Analyzing trace with hash 174941844, now seen corresponding path program 1 times [2024-11-08 22:20:15,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:20:15,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629794034] [2024-11-08 22:20:15,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:20:15,627 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 22:20:15,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:20:15,630 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 22:20:15,632 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 22:20:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:20:16,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:20:16,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:20:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-11-08 22:20:16,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:20:16,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:20:16,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629794034] [2024-11-08 22:20:16,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629794034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:20:16,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:20:16,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:20:16,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315216587] [2024-11-08 22:20:16,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:20:16,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:20:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:20:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:20:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:20:16,440 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 22:20:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:20:16,488 INFO L93 Difference]: Finished difference Result 163 states and 286 transitions. [2024-11-08 22:20:16,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:20:16,490 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2024-11-08 22:20:16,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:20:16,498 INFO L225 Difference]: With dead ends: 163 [2024-11-08 22:20:16,498 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 22:20:16,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 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 22:20:16,507 INFO L432 NwaCegarLoop]: 124 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, 124 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 22:20:16,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:20:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 22:20:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 22:20:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:20:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2024-11-08 22:20:16,562 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 181 [2024-11-08 22:20:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:20:16,563 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2024-11-08 22:20:16,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 22:20:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2024-11-08 22:20:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-08 22:20:16,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:20:16,568 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:20:16,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:20:16,769 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 22:20:16,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:20:16,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:20:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash -374585052, now seen corresponding path program 1 times [2024-11-08 22:20:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:20:16,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425693515] [2024-11-08 22:20:16,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:20:16,772 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 22:20:16,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:20:16,774 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 22:20:16,774 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 22:20:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:20:17,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:20:17,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:20:19,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:20:19,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:20:19,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:20:19,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425693515] [2024-11-08 22:20:19,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425693515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:20:19,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:20:19,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:20:19,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337033725] [2024-11-08 22:20:19,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:20:19,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:20:19,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:20:19,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:20:19,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:20:19,094 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:20:23,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:20:27,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:20:30,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:20:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:20:30,290 INFO L93 Difference]: Finished difference Result 251 states and 386 transitions. [2024-11-08 22:20:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:20:30,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2024-11-08 22:20:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:20:30,295 INFO L225 Difference]: With dead ends: 251 [2024-11-08 22:20:30,295 INFO L226 Difference]: Without dead ends: 173 [2024-11-08 22:20:30,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:20:30,297 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 114 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:20:30,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 409 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 81 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2024-11-08 22:20:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-08 22:20:30,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2024-11-08 22:20:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 22:20:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 241 transitions. [2024-11-08 22:20:30,360 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 241 transitions. Word has length 181 [2024-11-08 22:20:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:20:30,364 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 241 transitions. [2024-11-08 22:20:30,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:20:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 241 transitions. [2024-11-08 22:20:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 22:20:30,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:20:30,371 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:20:30,396 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 22:20:30,572 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 22:20:30,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:20:30,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:20:30,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1442736761, now seen corresponding path program 1 times [2024-11-08 22:20:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:20:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114080161] [2024-11-08 22:20:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:20:30,574 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 22:20:30,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:20:30,577 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 22:20:30,579 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 22:20:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:20:31,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:20:31,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:20:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:20:32,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:20:32,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:20:32,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114080161] [2024-11-08 22:20:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114080161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:20:32,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:20:32,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:20:32,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637286916] [2024-11-08 22:20:32,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:20:32,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:20:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:20:32,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:20:32,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:20:32,992 INFO L87 Difference]: Start difference. First operand 157 states and 241 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:20:35,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:20:39,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:20:44,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:20:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:20:44,578 INFO L93 Difference]: Finished difference Result 402 states and 617 transitions. [2024-11-08 22:20:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:20:44,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-08 22:20:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:20:44,611 INFO L225 Difference]: With dead ends: 402 [2024-11-08 22:20:44,612 INFO L226 Difference]: Without dead ends: 248 [2024-11-08 22:20:44,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:20:44,616 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 82 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:20:44,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 395 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 90 Invalid, 2 Unknown, 0 Unchecked, 11.5s Time] [2024-11-08 22:20:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-08 22:20:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 220. [2024-11-08 22:20:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-08 22:20:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 337 transitions. [2024-11-08 22:20:44,683 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 337 transitions. Word has length 183 [2024-11-08 22:20:44,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:20:44,684 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 337 transitions. [2024-11-08 22:20:44,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:20:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 337 transitions. [2024-11-08 22:20:44,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 22:20:44,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:20:44,699 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:20:44,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 22:20:44,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:20:44,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:20:44,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:20:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1184571323, now seen corresponding path program 1 times [2024-11-08 22:20:44,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:20:44,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310584877] [2024-11-08 22:20:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:20:44,902 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 22:20:44,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:20:44,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:20:44,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 22:20:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:20:45,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:20:45,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:20:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:20:45,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:20:45,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:20:45,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310584877] [2024-11-08 22:20:45,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310584877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:20:45,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:20:45,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:20:45,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682542420] [2024-11-08 22:20:45,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:20:45,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:20:45,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:20:45,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:20:45,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:20:45,541 INFO L87 Difference]: Start difference. First operand 220 states and 337 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:20:50,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:20:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:20:50,084 INFO L93 Difference]: Finished difference Result 382 states and 581 transitions. [2024-11-08 22:20:50,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:20:50,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-08 22:20:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:20:50,087 INFO L225 Difference]: With dead ends: 382 [2024-11-08 22:20:50,087 INFO L226 Difference]: Without dead ends: 228 [2024-11-08 22:20:50,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:20:50,091 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 33 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:20:50,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 222 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-08 22:20:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-08 22:20:50,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-08 22:20:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 138 states have internal predecessors, (173), 84 states have call successors, (84), 5 states have call predecessors, (84), 5 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-08 22:20:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 341 transitions. [2024-11-08 22:20:50,133 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 341 transitions. Word has length 183 [2024-11-08 22:20:50,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:20:50,135 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 341 transitions. [2024-11-08 22:20:50,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:20:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 341 transitions. [2024-11-08 22:20:50,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 22:20:50,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:20:50,140 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:20:50,163 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 (5)] Forceful destruction successful, exit code 0 [2024-11-08 22:20:50,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 22:20:50,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:20:50,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:20:50,341 INFO L85 PathProgramCache]: Analyzing trace with hash -448720888, now seen corresponding path program 1 times [2024-11-08 22:20:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:20:50,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715923785] [2024-11-08 22:20:50,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:20:50,343 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 22:20:50,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:20:50,347 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:20:50,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 22:20:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:20:50,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 22:20:50,954 INFO L278 TraceCheckSpWp]: Computing forward predicates...