./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.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 1c87c35ab7f46dfa906881dc78cf3989a4c72119f7f55258ddc47878726c0a4a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:02:05,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:02:05,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:02:05,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:02:05,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:02:05,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:02:05,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:02:05,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:02:05,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:02:05,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:02:05,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:02:05,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:02:05,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:02:05,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:02:05,545 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:02:05,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:02:05,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:02:05,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:02:05,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:02:05,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:02:05,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:02:05,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:02:05,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:02:05,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:02:05,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:02:05,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:02:05,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:02:05,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:02:05,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:02:05,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:02:05,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:02:05,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:02:05,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:02:05,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:02:05,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:02:05,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:02:05,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:02:05,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:02:05,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:02:05,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:02:05,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:02:05,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:02:05,558 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 -> 1c87c35ab7f46dfa906881dc78cf3989a4c72119f7f55258ddc47878726c0a4a [2024-11-16 13:02:05,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:02:05,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:02:05,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:02:05,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:02:05,845 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:02:05,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2024-11-16 13:02:07,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:02:07,538 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:02:07,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2024-11-16 13:02:07,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e108fee/32c02a94131840f188c294f0cd8f21a8/FLAG0cadd03cc [2024-11-16 13:02:07,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e108fee/32c02a94131840f188c294f0cd8f21a8 [2024-11-16 13:02:07,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:02:07,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:02:07,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:02:07,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:02:07,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:02:07,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:02:07" (1/1) ... [2024-11-16 13:02:07,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d705d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:07, skipping insertion in model container [2024-11-16 13:02:07,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:02:07" (1/1) ... [2024-11-16 13:02:07,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:02:08,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i[915,928] [2024-11-16 13:02:08,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:02:08,245 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:02:08,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i[915,928] [2024-11-16 13:02:08,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:02:08,316 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:02:08,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08 WrapperNode [2024-11-16 13:02:08,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:02:08,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:02:08,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:02:08,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:02:08,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (1/1) ... [2024-11-16 13:02:08,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (1/1) ... [2024-11-16 13:02:08,368 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2024-11-16 13:02:08,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:02:08,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:02:08,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:02:08,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:02:08,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (1/1) ... [2024-11-16 13:02:08,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (1/1) ... [2024-11-16 13:02:08,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (1/1) ... [2024-11-16 13:02:08,416 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-16 13:02:08,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (1/1) ... [2024-11-16 13:02:08,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (1/1) ... [2024-11-16 13:02:08,439 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (1/1) ... [2024-11-16 13:02:08,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (1/1) ... [2024-11-16 13:02:08,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (1/1) ... [2024-11-16 13:02:08,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (1/1) ... [2024-11-16 13:02:08,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:02:08,459 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:02:08,460 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:02:08,460 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:02:08,461 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (1/1) ... [2024-11-16 13:02:08,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:02:08,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:02:08,498 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-16 13:02:08,502 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-16 13:02:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:02:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:02:08,551 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:02:08,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:02:08,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:02:08,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:02:08,648 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:02:08,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:02:09,020 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L161: havoc property_#t~ite22#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short23#1; [2024-11-16 13:02:09,064 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-16 13:02:09,064 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:02:09,087 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:02:09,087 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:02:09,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:02:09 BoogieIcfgContainer [2024-11-16 13:02:09,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:02:09,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:02:09,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:02:09,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:02:09,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:02:07" (1/3) ... [2024-11-16 13:02:09,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169c922b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:02:09, skipping insertion in model container [2024-11-16 13:02:09,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:08" (2/3) ... [2024-11-16 13:02:09,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169c922b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:02:09, skipping insertion in model container [2024-11-16 13:02:09,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:02:09" (3/3) ... [2024-11-16 13:02:09,095 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2024-11-16 13:02:09,108 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:02:09,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:02:09,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:02:09,169 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;@1e447ee9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:02:09,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:02:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 71 states have internal predecessors, (99), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:02:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 13:02:09,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:02:09,196 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:02:09,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:02:09,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:02:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash -758187716, now seen corresponding path program 1 times [2024-11-16 13:02:09,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:02:09,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021576908] [2024-11-16 13:02:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:02:09,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:02:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:02:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:02:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:02:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:02:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:02:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:02:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:02:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:02:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:02:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:02:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:02:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:02:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:02:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:02:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:02:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:02:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:02:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:02:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:02:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:02:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:02:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:02:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:02:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:02:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:02:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:02:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:02:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:02:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:02:09,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:02:09,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021576908] [2024-11-16 13:02:09,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021576908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:02:09,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:02:09,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:02:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942595038] [2024-11-16 13:02:09,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:02:09,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:02:09,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:02:09,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:02:09,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:02:09,762 INFO L87 Difference]: Start difference. First operand has 101 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 71 states have internal predecessors, (99), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:02:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:02:09,811 INFO L93 Difference]: Finished difference Result 194 states and 331 transitions. [2024-11-16 13:02:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:02:09,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2024-11-16 13:02:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:02:09,822 INFO L225 Difference]: With dead ends: 194 [2024-11-16 13:02:09,822 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 13:02:09,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:02:09,835 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:02:09,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:02:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 13:02:09,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-16 13:02:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:02:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 145 transitions. [2024-11-16 13:02:09,895 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 145 transitions. Word has length 183 [2024-11-16 13:02:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:02:09,897 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 145 transitions. [2024-11-16 13:02:09,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:02:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 145 transitions. [2024-11-16 13:02:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 13:02:09,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:02:09,902 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:02:09,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:02:09,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:02:09,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:02:09,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1414878980, now seen corresponding path program 1 times [2024-11-16 13:02:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:02:09,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038982444] [2024-11-16 13:02:09,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:02:09,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:02:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:02:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:02:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:02:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:02:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:02:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:02:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:02:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:02:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:02:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:02:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:02:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:02:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:02:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:02:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:02:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:02:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:02:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:02:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:02:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:02:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:02:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:02:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:02:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:02:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:02:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:02:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:02:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:02:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:02:10,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:02:10,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038982444] [2024-11-16 13:02:10,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038982444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:02:10,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:02:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:02:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81070717] [2024-11-16 13:02:10,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:02:10,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:02:10,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:02:10,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:02:10,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:02:10,214 INFO L87 Difference]: Start difference. First operand 96 states and 145 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:02:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:02:10,254 INFO L93 Difference]: Finished difference Result 189 states and 287 transitions. [2024-11-16 13:02:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:02:10,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-16 13:02:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:02:10,257 INFO L225 Difference]: With dead ends: 189 [2024-11-16 13:02:10,257 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 13:02:10,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:02:10,259 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:02:10,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:02:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 13:02:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-16 13:02:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:02:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2024-11-16 13:02:10,270 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 183 [2024-11-16 13:02:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:02:10,272 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2024-11-16 13:02:10,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:02:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2024-11-16 13:02:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 13:02:10,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:02:10,275 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:02:10,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:02:10,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:02:10,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:02:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1823703205, now seen corresponding path program 1 times [2024-11-16 13:02:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:02:10,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210093178] [2024-11-16 13:02:10,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:02:10,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:02:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:02:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:02:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:02:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:02:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:02:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:02:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:02:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:02:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:02:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:02:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:02:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:02:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:02:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:02:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:02:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:02:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:02:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:02:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:02:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:02:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:02:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:02:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:02:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:02:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:02:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:02:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:02:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:02:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:02:10,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:02:10,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210093178] [2024-11-16 13:02:10,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210093178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:02:10,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:02:10,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:02:10,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081494070] [2024-11-16 13:02:10,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:02:10,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:02:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:02:10,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:02:10,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:02:10,724 INFO L87 Difference]: Start difference. First operand 96 states and 144 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:02:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:02:10,893 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2024-11-16 13:02:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:02:10,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-16 13:02:10,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:02:10,900 INFO L225 Difference]: With dead ends: 281 [2024-11-16 13:02:10,901 INFO L226 Difference]: Without dead ends: 188 [2024-11-16 13:02:10,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:02:10,903 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 129 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:02:10,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 373 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:02:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-16 13:02:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 115. [2024-11-16 13:02:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 85 states have (on average 1.388235294117647) internal successors, (118), 85 states have internal predecessors, (118), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:02:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 174 transitions. [2024-11-16 13:02:10,929 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 174 transitions. Word has length 183 [2024-11-16 13:02:10,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:02:10,930 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 174 transitions. [2024-11-16 13:02:10,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:02:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 174 transitions. [2024-11-16 13:02:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 13:02:10,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:02:10,936 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:02:10,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 13:02:10,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:02:10,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:02:10,936 INFO L85 PathProgramCache]: Analyzing trace with hash -826630852, now seen corresponding path program 1 times [2024-11-16 13:02:10,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:02:10,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376628422] [2024-11-16 13:02:10,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:02:10,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:02:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:02:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:02:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:02:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:02:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:02:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:02:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:02:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:02:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:02:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:02:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:02:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:02:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:02:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:02:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:02:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:02:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:02:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:02:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:02:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:02:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:02:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:02:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:02:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:02:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:02:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:02:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:02:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:02:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:02:11,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:02:11,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376628422] [2024-11-16 13:02:11,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376628422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:02:11,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:02:11,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:02:11,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860336056] [2024-11-16 13:02:11,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:02:11,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:02:11,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:02:11,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:02:11,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:02:11,475 INFO L87 Difference]: Start difference. First operand 115 states and 174 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:02:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:02:11,654 INFO L93 Difference]: Finished difference Result 227 states and 345 transitions. [2024-11-16 13:02:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:02:11,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-16 13:02:11,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:02:11,658 INFO L225 Difference]: With dead ends: 227 [2024-11-16 13:02:11,658 INFO L226 Difference]: Without dead ends: 115 [2024-11-16 13:02:11,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:02:11,663 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 89 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:02:11,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 211 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:02:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-16 13:02:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-16 13:02:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:02:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2024-11-16 13:02:11,686 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 183 [2024-11-16 13:02:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:02:11,690 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2024-11-16 13:02:11,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:02:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2024-11-16 13:02:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 13:02:11,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:02:11,697 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:02:11,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 13:02:11,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:02:11,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:02:11,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1337165029, now seen corresponding path program 1 times [2024-11-16 13:02:11,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:02:11,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306849406] [2024-11-16 13:02:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:02:11,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:02:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:11,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:02:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:02:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:02:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:02:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:02:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:02:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:02:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 13:02:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:02:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:02:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:02:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:02:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:02:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:02:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:02:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:02:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:02:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:02:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:02:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 13:02:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:02:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 13:02:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:02:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 13:02:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 13:02:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 13:02:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 13:02:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 13:02:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:02:12,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:02:12,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306849406] [2024-11-16 13:02:12,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306849406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:02:12,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:02:12,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:02:12,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332544829] [2024-11-16 13:02:12,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:02:12,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:02:12,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:02:12,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:02:12,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:02:12,123 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:02:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:02:12,532 INFO L93 Difference]: Finished difference Result 300 states and 449 transitions. [2024-11-16 13:02:12,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:02:12,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-16 13:02:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:02:12,535 INFO L225 Difference]: With dead ends: 300 [2024-11-16 13:02:12,538 INFO L226 Difference]: Without dead ends: 188 [2024-11-16 13:02:12,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:02:12,540 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 227 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 13:02:12,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 316 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 13:02:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-16 13:02:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 120. [2024-11-16 13:02:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:02:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 177 transitions. [2024-11-16 13:02:12,598 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 177 transitions. Word has length 183 [2024-11-16 13:02:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:02:12,599 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 177 transitions. [2024-11-16 13:02:12,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:02:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 177 transitions. [2024-11-16 13:02:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-16 13:02:12,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:02:12,604 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:02:12,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 13:02:12,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:02:12,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:02:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash 982336776, now seen corresponding path program 1 times [2024-11-16 13:02:12,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:02:12,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007537249] [2024-11-16 13:02:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:02:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:02:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:02:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102156870] [2024-11-16 13:02:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:02:12,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:02:12,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:02:12,765 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-16 13:02:12,766 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-16 13:02:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:02:12,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:02:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:02:13,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:02:13,081 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:02:13,082 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:02:13,104 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-16 13:02:13,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 13:02:13,288 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 13:02:13,428 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:02:13,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:02:13 BoogieIcfgContainer [2024-11-16 13:02:13,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:02:13,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:02:13,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:02:13,432 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:02:13,432 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:02:09" (3/4) ... [2024-11-16 13:02:13,435 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:02:13,436 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:02:13,436 INFO L158 Benchmark]: Toolchain (without parser) took 5530.40ms. Allocated memory was 155.2MB in the beginning and 249.6MB in the end (delta: 94.4MB). Free memory was 100.0MB in the beginning and 134.9MB in the end (delta: -34.9MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2024-11-16 13:02:13,437 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:02:13,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.70ms. Allocated memory is still 155.2MB. Free memory was 100.0MB in the beginning and 84.0MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 13:02:13,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.23ms. Allocated memory is still 155.2MB. Free memory was 84.0MB in the beginning and 80.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:02:13,437 INFO L158 Benchmark]: Boogie Preprocessor took 89.27ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 76.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:02:13,437 INFO L158 Benchmark]: IcfgBuilder took 628.45ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 76.9MB in the beginning and 169.1MB in the end (delta: -92.2MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-11-16 13:02:13,438 INFO L158 Benchmark]: TraceAbstraction took 4341.34ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 169.1MB in the beginning and 134.9MB in the end (delta: 34.2MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. [2024-11-16 13:02:13,438 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 249.6MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:02:13,439 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.19ms. Allocated memory is still 155.2MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.70ms. Allocated memory is still 155.2MB. Free memory was 100.0MB in the beginning and 84.0MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.23ms. Allocated memory is still 155.2MB. Free memory was 84.0MB in the beginning and 80.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.27ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 76.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 628.45ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 76.9MB in the beginning and 169.1MB in the end (delta: -92.2MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4341.34ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 169.1MB in the beginning and 134.9MB in the end (delta: 34.2MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 249.6MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 161. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] unsigned long int var_1_24 = 2; [L41] unsigned long int var_1_25 = 2; [L42] unsigned long int var_1_26 = 1; [L43] unsigned short int var_1_27 = 256; [L44] unsigned short int var_1_28 = 10; [L45] unsigned short int var_1_29 = 16; [L46] signed long int var_1_30 = -16; [L47] unsigned char var_1_31 = 0; [L48] unsigned char var_1_32 = 32; [L49] unsigned char var_1_33 = 5; [L50] signed long int last_1_var_1_9 = -50; VAL [isInitial=0, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L165] isInitial = 1 [L166] FCALL initially() [L167] COND TRUE 1 [L168] CALL updateLastVariables() [L158] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L168] RET updateLastVariables() [L169] CALL updateVariables() [L114] var_1_5 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L115] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L116] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L116] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L117] var_1_6 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L118] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L119] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L119] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L120] var_1_8 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L121] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L122] var_1_14 = __VERIFIER_nondet_ulong() [L123] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L123] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L124] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L124] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L125] var_1_15 = __VERIFIER_nondet_ulong() [L126] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L126] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L127] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L127] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L128] var_1_16 = __VERIFIER_nondet_ulong() [L129] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L129] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L130] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L130] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L131] var_1_17 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L132] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L133] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L133] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L134] var_1_18 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L135] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L136] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L136] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L137] var_1_20 = __VERIFIER_nondet_ushort() [L138] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L138] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L139] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L139] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L140] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L140] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L141] var_1_23 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L142] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L143] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L143] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L144] var_1_25 = __VERIFIER_nondet_ulong() [L145] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L145] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L146] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L146] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L147] var_1_28 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L148] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L149] CALL assume_abort_if_not(var_1_28 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L149] RET assume_abort_if_not(var_1_28 <= 65534) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L150] var_1_31 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L151] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L152] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L152] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] var_1_33 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L154] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L155] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L155] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] RET updateVariables() [L170] CALL step() [L54] var_1_24 = var_1_25 [L55] var_1_26 = var_1_25 [L56] var_1_27 = var_1_28 [L57] var_1_29 = var_1_28 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L58] EXPR var_1_29 & var_1_27 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L58] COND FALSE !(var_1_24 <= (var_1_29 & var_1_27)) [L63] var_1_32 = var_1_33 [L64] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_0=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L65] COND FALSE !(stepLocal_0 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L68] var_1_21 = var_1_6 [L69] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L70] COND FALSE !((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L73] unsigned long int stepLocal_4 = 4256310412u - 128u; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_4=4256310284, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L74] COND FALSE !(var_1_4 >= stepLocal_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L77] signed long int stepLocal_3 = var_1_9; [L78] unsigned long int stepLocal_2 = (((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L79] EXPR var_1_21 ^ 4u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L79] unsigned long int stepLocal_1 = var_1_21 ^ 4u; [L80] COND FALSE !(var_1_9 <= stepLocal_2) [L89] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L91] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L98] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L100] signed long int stepLocal_5 = (var_1_22 / 2) / var_1_20; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, stepLocal_5=0, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L101] COND TRUE stepLocal_5 >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L102] COND TRUE \read(var_1_13) [L103] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L170] RET step() [L171] CALL, EXPR property() [L161] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L161] EXPR (var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L161] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L161-L162] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L171] RET, EXPR property() [L171] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=3, var_1_23=3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 6, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 445 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 445 mSDsluCounter, 1317 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 517 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 260 IncrementalHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 800 mSDtfsCounter, 260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=5, InterpolantAutomatonStates: 17, 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, 141 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 1285 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 910 ConstructedInterpolants, 0 QuantifiedInterpolants, 1806 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 7560/7560 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-16 13:02:13,473 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_fillercodesize_ps-cn-10_file-61.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 1c87c35ab7f46dfa906881dc78cf3989a4c72119f7f55258ddc47878726c0a4a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:02:15,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:02:15,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:02:15,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:02:15,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:02:15,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:02:15,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:02:15,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:02:15,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:02:15,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:02:15,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:02:15,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:02:15,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:02:15,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:02:15,862 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:02:15,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:02:15,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:02:15,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:02:15,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:02:15,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:02:15,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:02:15,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:02:15,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:02:15,867 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:02:15,867 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:02:15,867 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:02:15,868 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:02:15,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:02:15,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:02:15,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:02:15,869 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:02:15,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:02:15,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:02:15,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:02:15,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:02:15,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:02:15,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:02:15,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:02:15,872 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:02:15,873 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:02:15,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:02:15,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:02:15,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:02:15,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:02:15,874 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 -> 1c87c35ab7f46dfa906881dc78cf3989a4c72119f7f55258ddc47878726c0a4a [2024-11-16 13:02:16,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:02:16,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:02:16,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:02:16,242 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:02:16,243 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:02:16,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2024-11-16 13:02:17,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:02:18,021 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:02:18,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2024-11-16 13:02:18,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c72ede5/c7eb2e0cf9d244fa8dae2b6f91806f46/FLAG2bf1a7806 [2024-11-16 13:02:18,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c72ede5/c7eb2e0cf9d244fa8dae2b6f91806f46 [2024-11-16 13:02:18,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:02:18,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:02:18,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:02:18,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:02:18,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:02:18,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290165e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18, skipping insertion in model container [2024-11-16 13:02:18,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:02:18,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i[915,928] [2024-11-16 13:02:18,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:02:18,715 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:02:18,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i[915,928] [2024-11-16 13:02:18,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:02:18,785 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:02:18,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18 WrapperNode [2024-11-16 13:02:18,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:02:18,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:02:18,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:02:18,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:02:18,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,847 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-16 13:02:18,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:02:18,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:02:18,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:02:18,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:02:18,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,885 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-16 13:02:18,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:02:18,918 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:02:18,918 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:02:18,918 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:02:18,919 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (1/1) ... [2024-11-16 13:02:18,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:02:18,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:02:18,951 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-16 13:02:18,957 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-16 13:02:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:02:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:02:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:02:19,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:02:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:02:19,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:02:19,115 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:02:19,117 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:02:19,616 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 13:02:19,618 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:02:19,634 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:02:19,635 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:02:19,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:02:19 BoogieIcfgContainer [2024-11-16 13:02:19,636 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:02:19,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:02:19,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:02:19,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:02:19,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:02:18" (1/3) ... [2024-11-16 13:02:19,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15df2ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:02:19, skipping insertion in model container [2024-11-16 13:02:19,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:02:18" (2/3) ... [2024-11-16 13:02:19,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15df2ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:02:19, skipping insertion in model container [2024-11-16 13:02:19,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:02:19" (3/3) ... [2024-11-16 13:02:19,646 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2024-11-16 13:02:19,664 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:02:19,664 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:02:19,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:02:19,746 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;@3a089500, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:02:19,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:02:19,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 52 states have internal predecessors, (69), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:02:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-16 13:02:19,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:02:19,770 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:02:19,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:02:19,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:02:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash -764639372, now seen corresponding path program 1 times [2024-11-16 13:02:19,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:02:19,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268629877] [2024-11-16 13:02:19,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:02:19,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:02:19,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:02:19,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:02:19,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 13:02:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:20,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:02:20,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:02:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2024-11-16 13:02:20,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:02:20,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:02:20,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268629877] [2024-11-16 13:02:20,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268629877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:02:20,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:02:20,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:02:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040881784] [2024-11-16 13:02:20,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:02:20,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:02:20,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:02:20,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:02:20,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:02:20,260 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 52 states have internal predecessors, (69), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:02:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:02:20,301 INFO L93 Difference]: Finished difference Result 156 states and 271 transitions. [2024-11-16 13:02:20,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:02:20,303 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2024-11-16 13:02:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:02:20,312 INFO L225 Difference]: With dead ends: 156 [2024-11-16 13:02:20,312 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 13:02:20,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 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-16 13:02:20,321 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:02:20,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:02:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 13:02:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-16 13:02:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:02:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-16 13:02:20,367 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 178 [2024-11-16 13:02:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:02:20,367 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-16 13:02:20,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:02:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2024-11-16 13:02:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-16 13:02:20,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:02:20,374 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:02:20,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 13:02:20,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:02:20,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:02:20,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:02:20,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2022572108, now seen corresponding path program 1 times [2024-11-16 13:02:20,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:02:20,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672752123] [2024-11-16 13:02:20,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:02:20,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:02:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:02:20,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:02:20,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 13:02:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:20,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 13:02:20,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:02:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:02:21,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:02:21,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:02:21,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672752123] [2024-11-16 13:02:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672752123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:02:21,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:02:21,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:02:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539757708] [2024-11-16 13:02:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:02:21,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:02:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:02:21,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:02:21,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:02:21,524 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:02:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:02:22,124 INFO L93 Difference]: Finished difference Result 244 states and 372 transitions. [2024-11-16 13:02:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:02:22,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-11-16 13:02:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:02:22,135 INFO L225 Difference]: With dead ends: 244 [2024-11-16 13:02:22,136 INFO L226 Difference]: Without dead ends: 170 [2024-11-16 13:02:22,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:02:22,139 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 94 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 13:02:22,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 414 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 13:02:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-16 13:02:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 148. [2024-11-16 13:02:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 13:02:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 228 transitions. [2024-11-16 13:02:22,176 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 228 transitions. Word has length 178 [2024-11-16 13:02:22,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:02:22,178 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 228 transitions. [2024-11-16 13:02:22,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:02:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 228 transitions. [2024-11-16 13:02:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-16 13:02:22,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:02:22,181 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:02:22,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 13:02:22,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:02:22,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:02:22,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:02:22,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1761861011, now seen corresponding path program 1 times [2024-11-16 13:02:22,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:02:22,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729454839] [2024-11-16 13:02:22,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:02:22,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:02:22,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:02:22,388 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:02:22,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 13:02:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:22,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 13:02:22,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:02:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:02:22,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:02:22,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:02:22,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729454839] [2024-11-16 13:02:22,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729454839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:02:22,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:02:22,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:02:22,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849248909] [2024-11-16 13:02:22,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:02:22,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:02:22,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:02:22,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:02:22,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:02:22,972 INFO L87 Difference]: Start difference. First operand 148 states and 228 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:02:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:02:23,318 INFO L93 Difference]: Finished difference Result 151 states and 230 transitions. [2024-11-16 13:02:23,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:02:23,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-11-16 13:02:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:02:23,329 INFO L225 Difference]: With dead ends: 151 [2024-11-16 13:02:23,330 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 13:02:23,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:02:23,331 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 30 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 13:02:23,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 163 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 13:02:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 13:02:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-16 13:02:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:02:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-11-16 13:02:23,359 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 178 [2024-11-16 13:02:23,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:02:23,361 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-11-16 13:02:23,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:02:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-11-16 13:02:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-16 13:02:23,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:02:23,367 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:02:23,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 13:02:23,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:02:23,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:02:23,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:02:23,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1890943730, now seen corresponding path program 1 times [2024-11-16 13:02:23,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:02:23,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735531955] [2024-11-16 13:02:23,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:02:23,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:02:23,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:02:23,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:02:23,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 13:02:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:02:23,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 13:02:23,832 INFO L278 TraceCheckSpWp]: Computing forward predicates...