./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-46.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 985b50a0b8eeadb0f849d937466c4ec1e5f58df88650cbc5b820e0f210728055 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:27:49,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:27:49,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:27:49,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:27:49,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:27:49,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:27:49,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:27:49,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:27:49,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:27:49,966 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:27:49,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:27:49,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:27:49,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:27:49,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:27:49,968 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:27:49,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:27:49,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:27:49,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:27:49,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:27:49,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:27:49,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:27:49,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:27:49,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:27:49,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:27:49,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:27:49,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:27:49,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:27:49,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:27:49,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:27:49,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:27:49,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:27:49,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:27:49,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:27:49,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:27:49,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:27:49,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:27:49,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:27:49,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:27:49,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:27:49,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:27:49,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:27:49,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:27:49,983 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 -> 985b50a0b8eeadb0f849d937466c4ec1e5f58df88650cbc5b820e0f210728055 [2024-11-10 05:27:50,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:27:50,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:27:50,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:27:50,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:27:50,299 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:27:50,300 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-pr-ci_file-46.i [2024-11-10 05:27:51,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:27:51,997 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:27:51,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-46.i [2024-11-10 05:27:52,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5672dd234/d66740ea0ada46a8aafb4144e5dcabcd/FLAG7f15cd1b2 [2024-11-10 05:27:52,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5672dd234/d66740ea0ada46a8aafb4144e5dcabcd [2024-11-10 05:27:52,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:27:52,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:27:52,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:27:52,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:27:52,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:27:52,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5094b758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52, skipping insertion in model container [2024-11-10 05:27:52,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:27:52,249 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-pr-ci_file-46.i[919,932] [2024-11-10 05:27:52,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:27:52,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:27:52,401 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-pr-ci_file-46.i[919,932] [2024-11-10 05:27:52,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:27:52,478 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:27:52,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52 WrapperNode [2024-11-10 05:27:52,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:27:52,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:27:52,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:27:52,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:27:52,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,544 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-11-10 05:27:52,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:27:52,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:27:52,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:27:52,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:27:52,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,605 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:27:52,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,632 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:27:52,657 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:27:52,658 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:27:52,658 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:27:52,659 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (1/1) ... [2024-11-10 05:27:52,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:27:52,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:52,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 05:27:52,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 05:27:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:27:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:27:52,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:27:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:27:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:27:52,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:27:52,840 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:27:52,841 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:27:53,353 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L171: havoc property_#t~bitwise20#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2024-11-10 05:27:53,389 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-10 05:27:53,389 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:27:53,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:27:53,420 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:27:53,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:53 BoogieIcfgContainer [2024-11-10 05:27:53,421 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:27:53,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:27:53,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:27:53,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:27:53,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:27:52" (1/3) ... [2024-11-10 05:27:53,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a609d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:53, skipping insertion in model container [2024-11-10 05:27:53,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:52" (2/3) ... [2024-11-10 05:27:53,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a609d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:53, skipping insertion in model container [2024-11-10 05:27:53,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:53" (3/3) ... [2024-11-10 05:27:53,431 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-46.i [2024-11-10 05:27:53,447 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:27:53,448 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:27:53,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:27:53,512 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;@151dfc94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:27:53,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:27:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 05:27:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 05:27:53,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:53,530 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:27:53,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:53,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:53,539 INFO L85 PathProgramCache]: Analyzing trace with hash 794555275, now seen corresponding path program 1 times [2024-11-10 05:27:53,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:53,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604354108] [2024-11-10 05:27:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:53,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:27:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:27:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:27:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:27:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:27:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:27:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:27:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:27:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:27:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:27:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:27:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:27:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:27:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:27:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:53,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:27:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:54,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:27:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 05:27:54,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:54,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604354108] [2024-11-10 05:27:54,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604354108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:54,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:54,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:27:54,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202910138] [2024-11-10 05:27:54,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:54,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:27:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:54,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:27:54,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:27:54,046 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 05:27:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:54,090 INFO L93 Difference]: Finished difference Result 180 states and 306 transitions. [2024-11-10 05:27:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:27:54,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2024-11-10 05:27:54,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:54,104 INFO L225 Difference]: With dead ends: 180 [2024-11-10 05:27:54,105 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 05:27:54,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:27:54,114 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:54,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:27:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 05:27:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 05:27:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 05:27:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2024-11-10 05:27:54,170 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 155 [2024-11-10 05:27:54,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:54,172 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2024-11-10 05:27:54,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 05:27:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2024-11-10 05:27:54,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 05:27:54,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:54,177 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:27:54,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:27:54,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:54,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:54,180 INFO L85 PathProgramCache]: Analyzing trace with hash 656630680, now seen corresponding path program 1 times [2024-11-10 05:27:54,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149779412] [2024-11-10 05:27:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:28:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:28:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:13,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:28:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:28:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:28:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:28:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:28:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:28:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:28:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:28:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:28:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:28:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:28:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:28:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:28:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:28:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:28:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:28:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:28:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:28:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:28:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:28:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 05:28:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149779412] [2024-11-10 05:28:14,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149779412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:14,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:14,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 05:28:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26144954] [2024-11-10 05:28:14,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:14,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 05:28:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:14,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 05:28:14,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:28:14,051 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 05:28:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:15,442 INFO L93 Difference]: Finished difference Result 302 states and 454 transitions. [2024-11-10 05:28:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 05:28:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2024-11-10 05:28:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:15,445 INFO L225 Difference]: With dead ends: 302 [2024-11-10 05:28:15,445 INFO L226 Difference]: Without dead ends: 216 [2024-11-10 05:28:15,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:28:15,447 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 264 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:15,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 463 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 05:28:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-10 05:28:15,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 169. [2024-11-10 05:28:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 134 states have (on average 1.4776119402985075) internal successors, (198), 135 states have internal predecessors, (198), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 05:28:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 260 transitions. [2024-11-10 05:28:15,483 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 260 transitions. Word has length 156 [2024-11-10 05:28:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:15,484 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 260 transitions. [2024-11-10 05:28:15,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 05:28:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 260 transitions. [2024-11-10 05:28:15,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 05:28:15,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:15,488 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:28:15,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:28:15,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:15,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:15,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1381425609, now seen corresponding path program 1 times [2024-11-10 05:28:15,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:15,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508015704] [2024-11-10 05:28:15,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:15,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:28:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:28:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:28:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:28:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:28:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:28:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:28:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:28:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:28:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:28:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:28:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:28:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:28:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:28:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:28:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:28:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:28:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:28:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:28:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:28:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:28:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:28:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 75 proven. 105 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-11-10 05:28:16,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:16,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508015704] [2024-11-10 05:28:16,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508015704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:28:16,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678999543] [2024-11-10 05:28:16,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:16,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:28:16,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:28:16,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:28:16,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 05:28:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:16,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 05:28:16,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 680 proven. 105 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-11-10 05:28:17,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:28:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 75 proven. 114 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2024-11-10 05:28:19,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678999543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:28:19,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:28:19,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 36 [2024-11-10 05:28:19,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274328692] [2024-11-10 05:28:19,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:28:19,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 05:28:19,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:19,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 05:28:19,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 05:28:19,013 INFO L87 Difference]: Start difference. First operand 169 states and 260 transitions. Second operand has 36 states, 36 states have (on average 3.1944444444444446) internal successors, (115), 36 states have internal predecessors, (115), 8 states have call successors, (56), 4 states have call predecessors, (56), 10 states have return successors, (58), 8 states have call predecessors, (58), 8 states have call successors, (58) [2024-11-10 05:28:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:23,068 INFO L93 Difference]: Finished difference Result 1274 states and 1838 transitions. [2024-11-10 05:28:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-10 05:28:23,070 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.1944444444444446) internal successors, (115), 36 states have internal predecessors, (115), 8 states have call successors, (56), 4 states have call predecessors, (56), 10 states have return successors, (58), 8 states have call predecessors, (58), 8 states have call successors, (58) Word has length 156 [2024-11-10 05:28:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:23,081 INFO L225 Difference]: With dead ends: 1274 [2024-11-10 05:28:23,082 INFO L226 Difference]: Without dead ends: 1108 [2024-11-10 05:28:23,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 346 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2031 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2492, Invalid=6628, Unknown=0, NotChecked=0, Total=9120 [2024-11-10 05:28:23,091 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 2855 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2863 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:23,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2863 Valid, 912 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 05:28:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-11-10 05:28:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 190. [2024-11-10 05:28:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 160 states have (on average 1.5) internal successors, (240), 160 states have internal predecessors, (240), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 05:28:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 286 transitions. [2024-11-10 05:28:23,160 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 286 transitions. Word has length 156 [2024-11-10 05:28:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:23,161 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 286 transitions. [2024-11-10 05:28:23,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.1944444444444446) internal successors, (115), 36 states have internal predecessors, (115), 8 states have call successors, (56), 4 states have call predecessors, (56), 10 states have return successors, (58), 8 states have call predecessors, (58), 8 states have call successors, (58) [2024-11-10 05:28:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 286 transitions. [2024-11-10 05:28:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 05:28:23,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:23,167 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:28:23,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 05:28:23,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:28:23,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:23,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:23,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1081871650, now seen corresponding path program 1 times [2024-11-10 05:28:23,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:23,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979579681] [2024-11-10 05:28:23,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:23,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:28:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:28:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:28:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:28:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:28:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:28:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:28:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:28:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:28:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:28:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:28:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:28:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:28:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:28:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:28:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:28:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:28:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:28:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:28:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:28:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:28:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:28:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 05:28:35,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979579681] [2024-11-10 05:28:35,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979579681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:35,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:35,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 05:28:35,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818467893] [2024-11-10 05:28:35,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:35,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 05:28:35,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:35,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 05:28:35,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:28:35,319 INFO L87 Difference]: Start difference. First operand 190 states and 286 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 05:28:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:41,601 INFO L93 Difference]: Finished difference Result 602 states and 888 transitions. [2024-11-10 05:28:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 05:28:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 157 [2024-11-10 05:28:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:41,606 INFO L225 Difference]: With dead ends: 602 [2024-11-10 05:28:41,607 INFO L226 Difference]: Without dead ends: 415 [2024-11-10 05:28:41,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2024-11-10 05:28:41,609 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 848 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:41,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 469 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-10 05:28:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-10 05:28:41,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 217. [2024-11-10 05:28:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 187 states have (on average 1.4973262032085561) internal successors, (280), 187 states have internal predecessors, (280), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 05:28:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 326 transitions. [2024-11-10 05:28:41,642 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 326 transitions. Word has length 157 [2024-11-10 05:28:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:41,644 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 326 transitions. [2024-11-10 05:28:41,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 05:28:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 326 transitions. [2024-11-10 05:28:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 05:28:41,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:41,647 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:28:41,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:28:41,647 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:41,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:41,648 INFO L85 PathProgramCache]: Analyzing trace with hash -870520737, now seen corresponding path program 1 times [2024-11-10 05:28:41,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:41,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41073213] [2024-11-10 05:28:41,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:28:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:28:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:28:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:28:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:28:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:28:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:28:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:28:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:28:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:28:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:28:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:28:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:28:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:28:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:28:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:28:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:28:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:28:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:28:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:28:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:28:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:28:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 05:28:50,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:50,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41073213] [2024-11-10 05:28:50,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41073213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:50,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:50,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 05:28:50,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021630830] [2024-11-10 05:28:50,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:50,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 05:28:50,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:50,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 05:28:50,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 05:28:50,606 INFO L87 Difference]: Start difference. First operand 217 states and 326 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 05:28:53,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 05:29:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:01,848 INFO L93 Difference]: Finished difference Result 727 states and 1064 transitions. [2024-11-10 05:29:01,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 05:29:01,849 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 157 [2024-11-10 05:29:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:01,852 INFO L225 Difference]: With dead ends: 727 [2024-11-10 05:29:01,852 INFO L226 Difference]: Without dead ends: 513 [2024-11-10 05:29:01,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2024-11-10 05:29:01,854 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 892 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:01,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 452 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-10 05:29:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-10 05:29:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 233. [2024-11-10 05:29:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 203 states have (on average 1.4926108374384237) internal successors, (303), 203 states have internal predecessors, (303), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 05:29:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 349 transitions. [2024-11-10 05:29:01,884 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 349 transitions. Word has length 157 [2024-11-10 05:29:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:01,885 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 349 transitions. [2024-11-10 05:29:01,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 05:29:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 349 transitions. [2024-11-10 05:29:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 05:29:01,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:01,888 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:01,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:29:01,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:01,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:01,889 INFO L85 PathProgramCache]: Analyzing trace with hash 162892831, now seen corresponding path program 1 times [2024-11-10 05:29:01,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:01,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567062827] [2024-11-10 05:29:01,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:01,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:29:02,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2063550257] [2024-11-10 05:29:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:02,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:29:02,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:29:02,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:29:02,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 05:29:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:29:02,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:29:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:29:02,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:29:02,548 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:29:02,549 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:29:02,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 05:29:02,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 05:29:02,759 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 05:29:02,858 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:29:02,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:29:02 BoogieIcfgContainer [2024-11-10 05:29:02,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:29:02,861 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:29:02,861 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:29:02,862 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:29:02,862 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:53" (3/4) ... [2024-11-10 05:29:02,864 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:29:02,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:29:02,866 INFO L158 Benchmark]: Toolchain (without parser) took 70838.69ms. Allocated memory was 203.4MB in the beginning and 562.0MB in the end (delta: 358.6MB). Free memory was 150.9MB in the beginning and 503.2MB in the end (delta: -352.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-11-10 05:29:02,867 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory was 98.4MB in the beginning and 98.3MB in the end (delta: 29.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:29:02,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.58ms. Allocated memory is still 203.4MB. Free memory was 150.5MB in the beginning and 133.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 05:29:02,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.91ms. Allocated memory is still 203.4MB. Free memory was 133.1MB in the beginning and 126.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 05:29:02,868 INFO L158 Benchmark]: Boogie Preprocessor took 110.53ms. Allocated memory is still 203.4MB. Free memory was 126.8MB in the beginning and 120.0MB in the end (delta: 6.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:29:02,868 INFO L158 Benchmark]: IcfgBuilder took 763.89ms. Allocated memory is still 203.4MB. Free memory was 120.0MB in the beginning and 144.6MB in the end (delta: -24.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-11-10 05:29:02,870 INFO L158 Benchmark]: TraceAbstraction took 69437.70ms. Allocated memory was 203.4MB in the beginning and 562.0MB in the end (delta: 358.6MB). Free memory was 143.6MB in the beginning and 503.2MB in the end (delta: -359.6MB). Peak memory consumption was 316.6MB. Max. memory is 16.1GB. [2024-11-10 05:29:02,871 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 562.0MB. Free memory is still 503.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:29:02,874 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.21ms. Allocated memory is still 134.2MB. Free memory was 98.4MB in the beginning and 98.3MB in the end (delta: 29.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.58ms. Allocated memory is still 203.4MB. Free memory was 150.5MB in the beginning and 133.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.91ms. Allocated memory is still 203.4MB. Free memory was 133.1MB in the beginning and 126.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.53ms. Allocated memory is still 203.4MB. Free memory was 126.8MB in the beginning and 120.0MB in the end (delta: 6.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 763.89ms. Allocated memory is still 203.4MB. Free memory was 120.0MB in the beginning and 144.6MB in the end (delta: -24.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 69437.70ms. Allocated memory was 203.4MB in the beginning and 562.0MB in the end (delta: 358.6MB). Free memory was 143.6MB in the beginning and 503.2MB in the end (delta: -359.6MB). Peak memory consumption was 316.6MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 562.0MB. Free memory is still 503.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 171. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 128; [L26] unsigned char var_1_5 = 10; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 52077; [L29] unsigned short int var_1_8 = 47248; [L30] unsigned short int var_1_9 = 50; [L31] float var_1_11 = 63.75; [L32] signed long int var_1_12 = 100000; [L33] unsigned short int var_1_13 = 8; [L34] signed long int var_1_14 = 2; [L35] signed long int var_1_15 = 32; [L36] double var_1_17 = 127.5; [L37] double var_1_18 = 32.75; [L38] signed char var_1_19 = 0; [L39] unsigned long int var_1_20 = 128; [L40] unsigned long int var_1_21 = 32; [L41] unsigned char var_1_23 = 0; [L42] unsigned char var_1_25 = 0; [L43] unsigned char var_1_26 = 1; [L44] unsigned char var_1_27 = 16; [L45] signed long int var_1_29 = 5; [L46] unsigned char var_1_31 = 128; [L47] signed char var_1_33 = 50; [L48] unsigned short int last_1_var_1_13 = 8; [L49] double last_1_var_1_17 = 127.5; VAL [isInitial=0, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L175] isInitial = 1 [L176] FCALL initially() [L177] COND TRUE 1 [L178] CALL updateLastVariables() [L167] last_1_var_1_13 = var_1_13 [L168] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L178] RET updateLastVariables() [L179] CALL updateVariables() [L130] var_1_2 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L131] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L132] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L132] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L133] var_1_3 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L134] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L135] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L135] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L137] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L138] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L139] var_1_5 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L140] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L141] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L142] var_1_7 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L143] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L144] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L145] var_1_8 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_8 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L146] RET assume_abort_if_not(var_1_8 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L147] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L148] var_1_11 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L149] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L150] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L150] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L151] var_1_14 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L152] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L153] CALL assume_abort_if_not(var_1_14 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L153] RET assume_abort_if_not(var_1_14 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L154] var_1_15 = __VERIFIER_nondet_long() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L156] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L156] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L157] var_1_18 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L158] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L159] var_1_25 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L160] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L161] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L161] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L162] var_1_26 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L163] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L164] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L164] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L179] RET updateVariables() [L180] CALL step() [L53] COND FALSE !(-100000 >= last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L56] COND FALSE !((last_1_var_1_17 / var_1_11) == 999999.6f) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L60] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, stepLocal_0=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L61] COND TRUE var_1_2 && stepLocal_0 [L62] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=32, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L66] COND FALSE !((-25 + (var_1_15 + var_1_5)) <= var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=32, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L73] COND TRUE var_1_1 <= (var_1_5 * var_1_4) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=32, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L74] COND TRUE \read(var_1_2) [L75] var_1_6 = (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_19=0, var_1_1=32, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L82] var_1_21 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) [L83] var_1_17 = var_1_18 [L84] var_1_19 = 5 [L85] var_1_27 = var_1_5 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=128, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L86] COND TRUE var_1_1 != (var_1_6 + var_1_4) [L87] var_1_29 = ((((var_1_4) > (((((((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_15)) ? (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) : (var_1_15))))) ? (var_1_4) : (((((((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_15)) ? (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) : (var_1_15)))))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=128, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=159, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L91] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=159, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L92] COND TRUE var_1_2 || (var_1_25 && var_1_2) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=159, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L93] COND TRUE var_1_6 >= var_1_14 [L94] var_1_33 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=159, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L103] COND FALSE !(var_1_1 < var_1_20) [L110] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=159, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L112] COND FALSE !(var_1_4 > var_1_6) [L117] var_1_23 = (! var_1_26) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=159, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L119] EXPR -4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=159, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L119] EXPR var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=159, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L119] COND FALSE !((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) [L126] var_1_13 = var_1_1 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=32, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=159, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L180] RET step() [L181] CALL, EXPR property() [L171] EXPR (((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=32, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=159, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L171-L172] return ((((((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1)))) && (var_1_17 == ((double) var_1_18))) && (var_1_19 == ((signed char) 5))) && (var_1_20 == ((unsigned long int) var_1_15)) ; [L181] RET, EXPR property() [L181] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=32, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=159, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=32640, var_1_13=32, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=32, var_1_20=32, var_1_21=32767, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=127, var_1_29=159, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=159, var_1_5=127, var_1_6=32640, var_1_7=32767, var_1_8=32767, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.3s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4867 SdHoareTripleChecker+Valid, 13.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4859 mSDsluCounter, 2426 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1786 mSDsCounter, 582 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3805 IncrementalHoareTripleChecker+Invalid, 4387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 582 mSolverCounterUnsat, 640 mSDtfsCounter, 3805 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 723 GetRequests, 582 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2094 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=5, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 1443 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 43.7s InterpolantComputationTime, 1251 NumberOfCodeBlocks, 1251 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1086 ConstructedInterpolants, 0 QuantifiedInterpolants, 11942 SizeOfPredicates, 8 NumberOfNonLiveVariables, 370 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6760/7084 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 05:29:03,060 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-pr-ci_file-46.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 985b50a0b8eeadb0f849d937466c4ec1e5f58df88650cbc5b820e0f210728055 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:29:05,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:29:05,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:29:05,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:29:05,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:29:05,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:29:05,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:29:05,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:29:05,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:29:05,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:29:05,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:29:05,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:29:05,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:29:05,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:29:05,353 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:29:05,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:29:05,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:29:05,354 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:29:05,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:29:05,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:29:05,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:29:05,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:29:05,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:29:05,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:29:05,362 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:29:05,362 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:29:05,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:29:05,363 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:29:05,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:29:05,363 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:29:05,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:29:05,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:29:05,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:29:05,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:29:05,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:29:05,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:29:05,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:29:05,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:29:05,366 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:29:05,367 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:29:05,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:29:05,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:29:05,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:29:05,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:29:05,368 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 -> 985b50a0b8eeadb0f849d937466c4ec1e5f58df88650cbc5b820e0f210728055 [2024-11-10 05:29:05,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:29:05,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:29:05,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:29:05,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:29:05,755 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:29:05,757 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-pr-ci_file-46.i [2024-11-10 05:29:07,424 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:29:07,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:29:07,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-46.i [2024-11-10 05:29:07,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73719abed/248422f1244f43a5ac33a70383e03c92/FLAG69b148518 [2024-11-10 05:29:08,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73719abed/248422f1244f43a5ac33a70383e03c92 [2024-11-10 05:29:08,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:29:08,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:29:08,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:29:08,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:29:08,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:29:08,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:29:08" (1/1) ... [2024-11-10 05:29:08,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fed0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:08, skipping insertion in model container [2024-11-10 05:29:08,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:29:08" (1/1) ... [2024-11-10 05:29:08,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:29:08,259 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-pr-ci_file-46.i[919,932] [2024-11-10 05:29:08,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:29:08,350 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:29:08,362 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-pr-ci_file-46.i[919,932] [2024-11-10 05:29:08,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:29:08,442 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:29:08,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:08 WrapperNode [2024-11-10 05:29:08,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:29:08,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:29:08,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:29:08,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:29:08,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:08" (1/1) ... [2024-11-10 05:29:08,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:08" (1/1) ... [2024-11-10 05:29:08,510 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-11-10 05:29:08,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:29:08,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:29:08,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:29:08,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:29:08,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:08" (1/1) ... [2024-11-10 05:29:08,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:08" (1/1) ... [2024-11-10 05:29:08,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:08" (1/1) ... [2024-11-10 05:29:08,574 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:29:08,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:08" (1/1) ... [2024-11-10 05:29:08,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:08" (1/1) ...