./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.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 c579f29dd297151eeefedc3486049e913885e258239c3282b0f6f33e5cae0f92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:44:47,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:44:47,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:44:47,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:44:47,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:44:47,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:44:47,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:44:47,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:44:47,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:44:47,648 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:44:47,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:44:47,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:44:47,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:44:47,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:44:47,649 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:44:47,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:44:47,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:44:47,649 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:44:47,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:44:47,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:44:47,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:44:47,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:44:47,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:44:47,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:44:47,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:44:47,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:44:47,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:44:47,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:44:47,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:44:47,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:44:47,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:44:47,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:44:47,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:44:47,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:44:47,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:44:47,651 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:44:47,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:44:47,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:44:47,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:44:47,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:44:47,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:44:47,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:44:47,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:44:47,652 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> c579f29dd297151eeefedc3486049e913885e258239c3282b0f6f33e5cae0f92 [2025-03-03 21:44:47,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:44:47,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:44:47,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:44:47,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:44:47,864 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:44:47,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i [2025-03-03 21:44:49,051 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7466138cf/e8ed18002d954b9ab0a2bd99ceb954b3/FLAG8cb743c4f [2025-03-03 21:44:49,298 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:44:49,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i [2025-03-03 21:44:49,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7466138cf/e8ed18002d954b9ab0a2bd99ceb954b3/FLAG8cb743c4f [2025-03-03 21:44:49,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7466138cf/e8ed18002d954b9ab0a2bd99ceb954b3 [2025-03-03 21:44:49,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:44:49,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:44:49,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:44:49,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:44:49,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:44:49,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49, skipping insertion in model container [2025-03-03 21:44:49,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:44:49,760 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i[919,932] [2025-03-03 21:44:49,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:44:49,845 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:44:49,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i[919,932] [2025-03-03 21:44:49,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:44:49,891 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:44:49,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49 WrapperNode [2025-03-03 21:44:49,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:44:49,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:44:49,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:44:49,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:44:49,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,929 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 237 [2025-03-03 21:44:49,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:44:49,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:44:49,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:44:49,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:44:49,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,955 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]. [2025-03-03 21:44:49,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:44:49,969 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:44:49,969 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:44:49,969 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:44:49,970 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (1/1) ... [2025-03-03 21:44:49,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:44:49,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:44:50,002 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) [2025-03-03 21:44:50,006 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 [2025-03-03 21:44:50,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:44:50,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:44:50,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:44:50,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:44:50,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:44:50,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:44:50,080 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:44:50,082 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:44:50,421 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L190: havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2025-03-03 21:44:50,457 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 21:44:50,457 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:44:50,471 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:44:50,471 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:44:50,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:50 BoogieIcfgContainer [2025-03-03 21:44:50,472 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:44:50,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:44:50,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:44:50,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:44:50,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:44:49" (1/3) ... [2025-03-03 21:44:50,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0282a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:50, skipping insertion in model container [2025-03-03 21:44:50,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:49" (2/3) ... [2025-03-03 21:44:50,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0282a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:50, skipping insertion in model container [2025-03-03 21:44:50,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:50" (3/3) ... [2025-03-03 21:44:50,479 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i [2025-03-03 21:44:50,489 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:44:50,491 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:44:50,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:44:50,537 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;@2c96804b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:44:50,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:44:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 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) [2025-03-03 21:44:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 21:44:50,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:50,555 INFO L218 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] [2025-03-03 21:44:50,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:50,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash 807907501, now seen corresponding path program 1 times [2025-03-03 21:44:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:50,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937371459] [2025-03-03 21:44:50,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:50,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:50,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 21:44:50,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 21:44:50,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:50,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 21:44:50,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:50,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937371459] [2025-03-03 21:44:50,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937371459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:44:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772288794] [2025-03-03 21:44:50,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:50,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:50,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:44:50,879 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) [2025-03-03 21:44:50,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:44:50,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 21:44:51,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 21:44:51,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:51,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:51,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:44:51,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:44:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 21:44:51,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:44:51,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772288794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:51,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:44:51,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:44:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962530899] [2025-03-03 21:44:51,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:51,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:44:51,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:51,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:44:51,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:44:51,075 INFO L87 Difference]: Start difference. First operand has 99 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 21:44:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:51,104 INFO L93 Difference]: Finished difference Result 192 states and 333 transitions. [2025-03-03 21:44:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:44:51,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 2 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 184 [2025-03-03 21:44:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:51,110 INFO L225 Difference]: With dead ends: 192 [2025-03-03 21:44:51,111 INFO L226 Difference]: Without dead ends: 96 [2025-03-03 21:44:51,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:44:51,116 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:51,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:44:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-03 21:44:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-03 21:44:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 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) [2025-03-03 21:44:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 150 transitions. [2025-03-03 21:44:51,166 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 150 transitions. Word has length 184 [2025-03-03 21:44:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:51,167 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 150 transitions. [2025-03-03 21:44:51,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 21:44:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 150 transitions. [2025-03-03 21:44:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 21:44:51,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:51,172 INFO L218 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] [2025-03-03 21:44:51,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:44:51,373 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,SelfDestructingSolverStorable0 [2025-03-03 21:44:51,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:51,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:51,374 INFO L85 PathProgramCache]: Analyzing trace with hash -650526769, now seen corresponding path program 1 times [2025-03-03 21:44:51,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:51,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87528819] [2025-03-03 21:44:51,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:51,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:51,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 21:44:51,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 21:44:51,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:51,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:44:51,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87528819] [2025-03-03 21:44:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87528819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:51,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:51,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:44:51,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335533734] [2025-03-03 21:44:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:51,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:44:51,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:51,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:44:51,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:44:51,726 INFO L87 Difference]: Start difference. First operand 96 states and 150 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:44:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:51,793 INFO L93 Difference]: Finished difference Result 266 states and 423 transitions. [2025-03-03 21:44:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:44:51,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2025-03-03 21:44:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:51,795 INFO L225 Difference]: With dead ends: 266 [2025-03-03 21:44:51,795 INFO L226 Difference]: Without dead ends: 173 [2025-03-03 21:44:51,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:44:51,796 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 77 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:51,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 267 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:44:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-03 21:44:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 150. [2025-03-03 21:44:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 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) [2025-03-03 21:44:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 234 transitions. [2025-03-03 21:44:51,827 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 234 transitions. Word has length 184 [2025-03-03 21:44:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:51,828 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 234 transitions. [2025-03-03 21:44:51,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:44:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 234 transitions. [2025-03-03 21:44:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 21:44:51,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:51,831 INFO L218 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] [2025-03-03 21:44:51,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:44:51,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:51,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1082744705, now seen corresponding path program 1 times [2025-03-03 21:44:51,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:51,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515213757] [2025-03-03 21:44:51,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:51,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 21:44:51,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 21:44:51,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:51,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:44:52,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:52,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515213757] [2025-03-03 21:44:52,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515213757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:52,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:52,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:44:52,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349442713] [2025-03-03 21:44:52,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:52,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:44:52,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:52,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:44:52,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:44:52,027 INFO L87 Difference]: Start difference. First operand 150 states and 234 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:44:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:52,117 INFO L93 Difference]: Finished difference Result 267 states and 423 transitions. [2025-03-03 21:44:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:44:52,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2025-03-03 21:44:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:52,119 INFO L225 Difference]: With dead ends: 267 [2025-03-03 21:44:52,119 INFO L226 Difference]: Without dead ends: 174 [2025-03-03 21:44:52,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:44:52,120 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 74 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:52,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 400 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:44:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-03 21:44:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 151. [2025-03-03 21:44:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 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) [2025-03-03 21:44:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 235 transitions. [2025-03-03 21:44:52,150 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 235 transitions. Word has length 185 [2025-03-03 21:44:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:52,151 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 235 transitions. [2025-03-03 21:44:52,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:44:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 235 transitions. [2025-03-03 21:44:52,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 21:44:52,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:52,154 INFO L218 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] [2025-03-03 21:44:52,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:44:52,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:52,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash -871393792, now seen corresponding path program 1 times [2025-03-03 21:44:52,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:52,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321675977] [2025-03-03 21:44:52,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:52,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 21:44:52,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 21:44:52,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:52,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:44:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321675977] [2025-03-03 21:44:52,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321675977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:52,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:52,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:44:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827031823] [2025-03-03 21:44:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:52,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:44:52,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:52,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:44:52,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:44:52,344 INFO L87 Difference]: Start difference. First operand 151 states and 235 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:44:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:52,441 INFO L93 Difference]: Finished difference Result 315 states and 488 transitions. [2025-03-03 21:44:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:44:52,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2025-03-03 21:44:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:52,444 INFO L225 Difference]: With dead ends: 315 [2025-03-03 21:44:52,445 INFO L226 Difference]: Without dead ends: 222 [2025-03-03 21:44:52,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:44:52,446 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 99 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:52,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 370 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:44:52,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-03 21:44:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2025-03-03 21:44:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 140 states have (on average 1.35) internal successors, (189), 141 states have internal predecessors, (189), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 21:44:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 337 transitions. [2025-03-03 21:44:52,463 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 337 transitions. Word has length 185 [2025-03-03 21:44:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:52,464 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 337 transitions. [2025-03-03 21:44:52,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:44:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 337 transitions. [2025-03-03 21:44:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 21:44:52,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:52,465 INFO L218 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] [2025-03-03 21:44:52,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:44:52,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:52,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:52,466 INFO L85 PathProgramCache]: Analyzing trace with hash 481915905, now seen corresponding path program 1 times [2025-03-03 21:44:52,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:52,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654164283] [2025-03-03 21:44:52,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:52,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 21:44:52,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 21:44:52,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:52,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:52,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:44:52,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:52,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654164283] [2025-03-03 21:44:52,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654164283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:52,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:52,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:44:52,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280285505] [2025-03-03 21:44:52,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:52,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:44:52,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:52,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:44:52,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:44:52,852 INFO L87 Difference]: Start difference. First operand 219 states and 337 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:44:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:53,230 INFO L93 Difference]: Finished difference Result 656 states and 1009 transitions. [2025-03-03 21:44:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:44:53,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2025-03-03 21:44:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:53,236 INFO L225 Difference]: With dead ends: 656 [2025-03-03 21:44:53,238 INFO L226 Difference]: Without dead ends: 496 [2025-03-03 21:44:53,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:44:53,239 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 248 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:53,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 581 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:44:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-03 21:44:53,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 404. [2025-03-03 21:44:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 277 states have (on average 1.4115523465703972) internal successors, (391), 279 states have internal predecessors, (391), 120 states have call successors, (120), 6 states have call predecessors, (120), 6 states have return successors, (120), 118 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-03 21:44:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 631 transitions. [2025-03-03 21:44:53,275 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 631 transitions. Word has length 185 [2025-03-03 21:44:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:53,276 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 631 transitions. [2025-03-03 21:44:53,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:44:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 631 transitions. [2025-03-03 21:44:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 21:44:53,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:53,278 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:53,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:44:53,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:53,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:53,278 INFO L85 PathProgramCache]: Analyzing trace with hash -421054616, now seen corresponding path program 1 times [2025-03-03 21:44:53,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:53,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892747651] [2025-03-03 21:44:53,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:53,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:53,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 21:44:53,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 21:44:53,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:53,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:44:53,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:53,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892747651] [2025-03-03 21:44:53,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892747651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:53,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:53,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:44:53,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703510152] [2025-03-03 21:44:53,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:53,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:44:53,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:53,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:44:53,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:44:53,519 INFO L87 Difference]: Start difference. First operand 404 states and 631 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:44:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:53,839 INFO L93 Difference]: Finished difference Result 982 states and 1528 transitions. [2025-03-03 21:44:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:44:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2025-03-03 21:44:53,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:53,844 INFO L225 Difference]: With dead ends: 982 [2025-03-03 21:44:53,844 INFO L226 Difference]: Without dead ends: 640 [2025-03-03 21:44:53,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:44:53,845 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 171 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:53,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 318 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:44:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-03 21:44:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 608. [2025-03-03 21:44:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 436 states have (on average 1.415137614678899) internal successors, (617), 442 states have internal predecessors, (617), 160 states have call successors, (160), 11 states have call predecessors, (160), 11 states have return successors, (160), 154 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-03 21:44:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 937 transitions. [2025-03-03 21:44:53,890 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 937 transitions. Word has length 186 [2025-03-03 21:44:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:53,890 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 937 transitions. [2025-03-03 21:44:53,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 21:44:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 937 transitions. [2025-03-03 21:44:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 21:44:53,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:53,892 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:53,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:44:53,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:53,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:53,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1364791435, now seen corresponding path program 1 times [2025-03-03 21:44:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:53,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204459447] [2025-03-03 21:44:53,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:53,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:53,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 21:44:53,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 21:44:53,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:53,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:44:54,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:54,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204459447] [2025-03-03 21:44:54,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204459447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:54,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:54,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:44:54,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285602594] [2025-03-03 21:44:54,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:54,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:44:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:54,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:44:54,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:44:54,184 INFO L87 Difference]: Start difference. First operand 608 states and 937 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2025-03-03 21:44:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:54,465 INFO L93 Difference]: Finished difference Result 1118 states and 1716 transitions. [2025-03-03 21:44:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:44:54,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 188 [2025-03-03 21:44:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:54,470 INFO L225 Difference]: With dead ends: 1118 [2025-03-03 21:44:54,470 INFO L226 Difference]: Without dead ends: 640 [2025-03-03 21:44:54,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:44:54,473 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 151 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:54,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 499 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:44:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-03 21:44:54,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 560. [2025-03-03 21:44:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 388 states have (on average 1.3762886597938144) internal successors, (534), 394 states have internal predecessors, (534), 160 states have call successors, (160), 11 states have call predecessors, (160), 11 states have return successors, (160), 154 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-03 21:44:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 854 transitions. [2025-03-03 21:44:54,536 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 854 transitions. Word has length 188 [2025-03-03 21:44:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:54,536 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 854 transitions. [2025-03-03 21:44:54,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2025-03-03 21:44:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 854 transitions. [2025-03-03 21:44:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 21:44:54,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:54,538 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:54,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:44:54,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:54,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash -635242011, now seen corresponding path program 1 times [2025-03-03 21:44:54,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:54,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752872864] [2025-03-03 21:44:54,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:54,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:54,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 21:44:54,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 21:44:54,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:54,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:44:54,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:54,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752872864] [2025-03-03 21:44:54,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752872864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:54,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:54,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:44:54,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055220382] [2025-03-03 21:44:54,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:54,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:44:54,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:54,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:44:54,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:44:54,666 INFO L87 Difference]: Start difference. First operand 560 states and 854 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2025-03-03 21:44:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:54,744 INFO L93 Difference]: Finished difference Result 1071 states and 1644 transitions. [2025-03-03 21:44:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:44:54,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 188 [2025-03-03 21:44:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:54,748 INFO L225 Difference]: With dead ends: 1071 [2025-03-03 21:44:54,748 INFO L226 Difference]: Without dead ends: 586 [2025-03-03 21:44:54,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:44:54,750 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 69 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:54,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 400 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:44:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-03 21:44:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 560. [2025-03-03 21:44:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 388 states have (on average 1.3737113402061856) internal successors, (533), 394 states have internal predecessors, (533), 160 states have call successors, (160), 11 states have call predecessors, (160), 11 states have return successors, (160), 154 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-03 21:44:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 853 transitions. [2025-03-03 21:44:54,824 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 853 transitions. Word has length 188 [2025-03-03 21:44:54,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:54,825 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 853 transitions. [2025-03-03 21:44:54,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2025-03-03 21:44:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 853 transitions. [2025-03-03 21:44:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 21:44:54,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:54,828 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:54,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:44:54,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:54,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1621668996, now seen corresponding path program 1 times [2025-03-03 21:44:54,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:54,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278990621] [2025-03-03 21:44:54,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:54,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:54,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 21:44:54,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 21:44:54,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:54,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:44:55,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:55,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278990621] [2025-03-03 21:44:55,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278990621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:55,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:55,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:44:55,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249495991] [2025-03-03 21:44:55,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:55,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:44:55,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:55,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:44:55,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:44:55,627 INFO L87 Difference]: Start difference. First operand 560 states and 853 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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) [2025-03-03 21:44:56,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:56,232 INFO L93 Difference]: Finished difference Result 1236 states and 1863 transitions. [2025-03-03 21:44:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:44:56,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 188 [2025-03-03 21:44:56,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:56,236 INFO L225 Difference]: With dead ends: 1236 [2025-03-03 21:44:56,236 INFO L226 Difference]: Without dead ends: 772 [2025-03-03 21:44:56,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:44:56,238 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 235 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:56,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 693 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:44:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-03-03 21:44:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 604. [2025-03-03 21:44:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 431 states have (on average 1.357308584686775) internal successors, (585), 437 states have internal predecessors, (585), 160 states have call successors, (160), 12 states have call predecessors, (160), 12 states have return successors, (160), 154 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-03 21:44:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 905 transitions. [2025-03-03 21:44:56,290 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 905 transitions. Word has length 188 [2025-03-03 21:44:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:56,290 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 905 transitions. [2025-03-03 21:44:56,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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) [2025-03-03 21:44:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 905 transitions. [2025-03-03 21:44:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 21:44:56,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:56,292 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:56,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:44:56,292 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:56,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:56,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1475622526, now seen corresponding path program 1 times [2025-03-03 21:44:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:56,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439481748] [2025-03-03 21:44:56,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:56,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:56,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 21:44:56,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 21:44:56,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:56,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 24 proven. 57 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 21:44:56,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:56,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439481748] [2025-03-03 21:44:56,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439481748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:44:56,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917233058] [2025-03-03 21:44:56,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:56,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:56,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:44:56,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:44:56,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:44:56,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 21:44:56,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 21:44:56,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:56,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:56,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:44:56,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:44:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 651 proven. 57 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2025-03-03 21:44:57,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:44:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 24 proven. 57 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 21:44:57,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917233058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:44:57,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:44:57,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 21:44:57,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964348452] [2025-03-03 21:44:57,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:44:57,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 21:44:57,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:57,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 21:44:57,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:44:57,383 INFO L87 Difference]: Start difference. First operand 604 states and 905 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-03 21:44:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:57,767 INFO L93 Difference]: Finished difference Result 1532 states and 2251 transitions. [2025-03-03 21:44:57,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:44:57,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 190 [2025-03-03 21:44:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:57,775 INFO L225 Difference]: With dead ends: 1532 [2025-03-03 21:44:57,776 INFO L226 Difference]: Without dead ends: 1046 [2025-03-03 21:44:57,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:44:57,778 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 312 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:57,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 350 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:44:57,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-03 21:44:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 998. [2025-03-03 21:44:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 744 states have (on average 1.3494623655913978) internal successors, (1004), 758 states have internal predecessors, (1004), 224 states have call successors, (224), 29 states have call predecessors, (224), 29 states have return successors, (224), 210 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-03 21:44:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1452 transitions. [2025-03-03 21:44:57,858 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1452 transitions. Word has length 190 [2025-03-03 21:44:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:57,859 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1452 transitions. [2025-03-03 21:44:57,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-03 21:44:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1452 transitions. [2025-03-03 21:44:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 21:44:57,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:57,862 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:57,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 21:44:58,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 21:44:58,066 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:58,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:58,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1927201436, now seen corresponding path program 1 times [2025-03-03 21:44:58,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:58,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127246582] [2025-03-03 21:44:58,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:58,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:58,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 21:44:58,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 21:44:58,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:58,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 48 proven. 33 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 21:44:58,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:58,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127246582] [2025-03-03 21:44:58,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127246582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:44:58,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961025716] [2025-03-03 21:44:58,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:58,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:58,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:44:58,267 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:44:58,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 21:44:58,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 21:44:58,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 21:44:58,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:58,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:58,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:44:58,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:44:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 711 proven. 27 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2025-03-03 21:44:58,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:44:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 27 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 21:44:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961025716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:44:58,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:44:58,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-03-03 21:44:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743263569] [2025-03-03 21:44:58,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:44:58,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:44:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:58,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:44:58,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:44:58,607 INFO L87 Difference]: Start difference. First operand 998 states and 1452 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 4 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2025-03-03 21:44:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:58,953 INFO L93 Difference]: Finished difference Result 1956 states and 2812 transitions. [2025-03-03 21:44:58,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:44:58,954 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 4 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) Word has length 191 [2025-03-03 21:44:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:58,960 INFO L225 Difference]: With dead ends: 1956 [2025-03-03 21:44:58,960 INFO L226 Difference]: Without dead ends: 1068 [2025-03-03 21:44:58,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2025-03-03 21:44:58,962 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 164 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:58,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 294 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:44:58,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2025-03-03 21:44:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1030. [2025-03-03 21:44:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 768 states have (on average 1.3059895833333333) internal successors, (1003), 782 states have internal predecessors, (1003), 224 states have call successors, (224), 37 states have call predecessors, (224), 37 states have return successors, (224), 210 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-03 21:44:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1451 transitions. [2025-03-03 21:44:59,027 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1451 transitions. Word has length 191 [2025-03-03 21:44:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:59,027 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1451 transitions. [2025-03-03 21:44:59,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 4 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2025-03-03 21:44:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1451 transitions. [2025-03-03 21:44:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 21:44:59,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:59,029 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:59,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 21:44:59,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:59,233 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:59,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:59,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1722155929, now seen corresponding path program 1 times [2025-03-03 21:44:59,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:59,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109436927] [2025-03-03 21:44:59,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:59,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:59,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 21:44:59,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 21:44:59,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:59,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:44:59,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764446060] [2025-03-03 21:44:59,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:59,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:59,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:44:59,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:44:59,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 21:44:59,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 21:44:59,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 21:44:59,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:59,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:44:59,398 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:44:59,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 21:44:59,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 21:44:59,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:59,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:44:59,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:44:59,549 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:44:59,549 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:44:59,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 21:44:59,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:44:59,755 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:44:59,865 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:44:59,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:44:59 BoogieIcfgContainer [2025-03-03 21:44:59,869 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:44:59,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:44:59,870 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:44:59,870 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:44:59,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:50" (3/4) ... [2025-03-03 21:44:59,872 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:44:59,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:44:59,874 INFO L158 Benchmark]: Toolchain (without parser) took 10249.38ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 112.9MB in the beginning and 173.5MB in the end (delta: -60.5MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2025-03-03 21:44:59,874 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:44:59,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.05ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 97.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:44:59,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.17ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 92.7MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:44:59,875 INFO L158 Benchmark]: Boogie Preprocessor took 38.70ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 87.1MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:44:59,876 INFO L158 Benchmark]: IcfgBuilder took 502.66ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 55.5MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 21:44:59,876 INFO L158 Benchmark]: TraceAbstraction took 9395.94ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 54.9MB in the beginning and 173.5MB in the end (delta: -118.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2025-03-03 21:44:59,876 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 276.8MB. Free memory was 173.5MB in the beginning and 173.5MB in the end (delta: 54.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:44:59,877 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.22ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.05ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 97.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.17ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 92.7MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.70ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 87.1MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 502.66ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 55.5MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9395.94ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 54.9MB in the beginning and 173.5MB in the end (delta: -118.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 276.8MB. Free memory was 173.5MB in the beginning and 173.5MB in the end (delta: 54.1kB). 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 shiftRight at line 107, overapproximation of shiftRight at line 190, overapproximation of bitwiseOr at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 163. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 100; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned short int var_1_8 = 10; [L26] unsigned short int var_1_9 = 0; [L27] unsigned short int var_1_10 = 53946; [L28] unsigned short int var_1_11 = 1; [L29] unsigned long int var_1_12 = 8; [L30] double var_1_13 = 8.25; [L31] signed long int var_1_14 = -256; [L32] double var_1_15 = 0.19999999999999996; [L33] signed long int var_1_16 = -16; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = 4; [L36] signed char var_1_19 = 64; [L37] signed long int var_1_20 = 1; [L38] signed long int var_1_21 = 1000000000; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_26 = 0; [L41] unsigned short int var_1_28 = 16; [L42] signed short int var_1_30 = -256; [L43] signed short int var_1_32 = 8; [L44] unsigned short int var_1_33 = 128; [L45] double var_1_34 = 0.25; [L46] signed long int var_1_36 = -32; [L47] unsigned char var_1_38 = 0; [L48] unsigned char var_1_39 = 1; [L49] float var_1_40 = 2.6; [L50] unsigned char var_1_41 = 0; [L51] unsigned char var_1_42 = 0; [L52] unsigned short int last_1_var_1_1 = 100; [L53] unsigned long int last_1_var_1_12 = 8; [L54] double last_1_var_1_13 = 8.25; [L55] signed long int last_1_var_1_16 = -16; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_12 = var_1_12 [L186] last_1_var_1_13 = var_1_13 [L187] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L197] RET updateLastVariables() [L198] CALL updateVariables() [L140] var_1_6 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L141] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L142] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L143] var_1_7 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L145] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L146] var_1_8 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L149] var_1_9 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0] [L150] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0] [L151] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L151] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L152] var_1_10 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L155] var_1_11 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L156] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L157] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L158] var_1_14 = __VERIFIER_nondet_long() [L159] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L159] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L161] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L161] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L162] var_1_15 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L164] var_1_18 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L165] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L166] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L167] var_1_19 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_19 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L168] RET assume_abort_if_not(var_1_19 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L169] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L170] var_1_21 = __VERIFIER_nondet_long() [L171] CALL assume_abort_if_not(var_1_21 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L171] RET assume_abort_if_not(var_1_21 >= 536870911) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_21 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L172] RET assume_abort_if_not(var_1_21 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L173] var_1_26 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L174] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L175] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L175] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L176] var_1_39 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L177] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L178] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L178] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L179] var_1_42 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L180] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L181] CALL assume_abort_if_not(var_1_42 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L181] RET assume_abort_if_not(var_1_42 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L198] RET updateVariables() [L199] CALL step() [L59] COND FALSE !((var_1_20 + var_1_20) > 16) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L62] COND TRUE (~ var_1_20) <= var_1_18 [L63] var_1_23 = var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L68] var_1_28 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L69] COND TRUE var_1_16 < 2 [L70] var_1_30 = (((((((((var_1_26) > (var_1_19)) ? (var_1_26) : (var_1_19)))) > (var_1_12)) ? (((((var_1_26) > (var_1_19)) ? (var_1_26) : (var_1_19)))) : (var_1_12))) + var_1_19) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L74] EXPR var_1_11 | var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L74] COND FALSE !((~ (var_1_11 | var_1_20)) >= (~ (~ 32))) [L77] EXPR var_1_19 >> var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L77] COND FALSE !((var_1_19 >> var_1_18) <= var_1_18) [L82] COND FALSE !(var_1_12 >= var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L87] COND FALSE !(((var_1_8 - var_1_19) > var_1_8) && var_1_6) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L90] var_1_38 = var_1_39 [L91] var_1_40 = var_1_15 [L92] var_1_41 = var_1_42 [L93] unsigned char stepLocal_0 = last_1_var_1_13 >= last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_0=1, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L94] COND FALSE !((last_1_var_1_12 == last_1_var_1_1) && stepLocal_0) [L105] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L107] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L107] COND FALSE !((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) [L112] var_1_17 = (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1))))) [L113] unsigned long int stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=8, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L114] COND TRUE \read(var_1_6) [L115] var_1_20 = ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=8, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L123] unsigned char stepLocal_3 = var_1_6; [L124] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_2=1, stepLocal_3=1, stepLocal_4=8, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L125] COND FALSE !(stepLocal_2 && (var_1_9 < (var_1_10 + var_1_20))) [L130] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=8, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=0, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L132] signed long int stepLocal_1 = ((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_1=32768, stepLocal_3=1, stepLocal_4=8, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=0, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L133] COND TRUE stepLocal_1 >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8))) [L134] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=8, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-2, var_1_15=2, var_1_16=0, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L199] RET step() [L200] CALL, EXPR property() [L190] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-2, var_1_15=2, var_1_16=0, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L190] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-2, var_1_15=2, var_1_16=0, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L190] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-2, var_1_15=2, var_1_16=0, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L190-L191] return (((((((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1)) && (((((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14)) >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8)))) ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_15)))) && ((var_1_6 && (var_1_9 < (var_1_10 + var_1_20))) ? ((var_1_7 && var_1_6) ? (var_1_16 == ((signed long int) var_1_10)) : 1) : (var_1_16 == ((signed long int) var_1_8)))) && (var_1_17 == ((signed char) (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1)))))))) && (var_1_6 ? (var_1_20 == ((signed long int) ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10))) : (((~ var_1_19) == var_1_12) ? (var_1_20 == ((signed long int) var_1_1)) : (var_1_20 == ((signed long int) var_1_10)))) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-2, var_1_15=2, var_1_16=0, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-2, var_1_15=2, var_1_16=0, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=0, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 12, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1617 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1600 mSDsluCounter, 4317 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2835 mSDsCounter, 518 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1621 IncrementalHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 518 mSolverCounterUnsat, 1482 mSDtfsCounter, 1621 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1039 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1030occurred in iteration=11, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 533 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 3001 NumberOfCodeBlocks, 3001 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2984 ConstructedInterpolants, 0 QuantifiedInterpolants, 8528 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1354 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 23880/24192 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 21:44:59,898 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/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.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 c579f29dd297151eeefedc3486049e913885e258239c3282b0f6f33e5cae0f92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:45:01,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:45:01,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:45:01,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:45:01,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:45:01,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:45:01,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:45:01,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:45:01,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:45:01,834 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:45:01,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:45:01,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:45:01,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:45:01,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:45:01,834 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:45:01,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:45:01,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:45:01,834 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:45:01,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:45:01,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:45:01,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:45:01,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:45:01,835 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:45:01,836 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:45:01,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:45:01,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:45:01,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:45:01,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:45:01,836 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> c579f29dd297151eeefedc3486049e913885e258239c3282b0f6f33e5cae0f92 [2025-03-03 21:45:02,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:45:02,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:45:02,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:45:02,091 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:45:02,091 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:45:02,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i [2025-03-03 21:45:03,240 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb62d249/172e6d043eda4738bab0b2d90e61a066/FLAGf9ae83901 [2025-03-03 21:45:03,424 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:45:03,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i [2025-03-03 21:45:03,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb62d249/172e6d043eda4738bab0b2d90e61a066/FLAGf9ae83901 [2025-03-03 21:45:03,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb62d249/172e6d043eda4738bab0b2d90e61a066 [2025-03-03 21:45:03,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:45:03,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:45:03,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:45:03,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:45:03,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:45:03,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797ef942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03, skipping insertion in model container [2025-03-03 21:45:03,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:45:03,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i[919,932] [2025-03-03 21:45:03,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:45:03,661 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:45:03,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i[919,932] [2025-03-03 21:45:03,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:45:03,716 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:45:03,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03 WrapperNode [2025-03-03 21:45:03,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:45:03,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:45:03,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:45:03,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:45:03,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,754 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-03-03 21:45:03,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:45:03,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:45:03,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:45:03,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:45:03,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,779 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]. [2025-03-03 21:45:03,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:45:03,795 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:45:03,796 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:45:03,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:45:03,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (1/1) ... [2025-03-03 21:45:03,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:45:03,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:45:03,820 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) [2025-03-03 21:45:03,825 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 [2025-03-03 21:45:03,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:45:03,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:45:03,839 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:45:03,839 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:45:03,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:45:03,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:45:03,913 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:45:03,915 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:45:04,352 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 21:45:04,353 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:45:04,361 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:45:04,363 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:45:04,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:45:04 BoogieIcfgContainer [2025-03-03 21:45:04,363 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:45:04,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:45:04,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:45:04,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:45:04,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:45:03" (1/3) ... [2025-03-03 21:45:04,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46914a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:45:04, skipping insertion in model container [2025-03-03 21:45:04,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:03" (2/3) ... [2025-03-03 21:45:04,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46914a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:45:04, skipping insertion in model container [2025-03-03 21:45:04,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:45:04" (3/3) ... [2025-03-03 21:45:04,372 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i [2025-03-03 21:45:04,382 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:45:04,383 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:45:04,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:45:04,438 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;@5f0b37b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:45:04,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:45:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 21:45:04,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 21:45:04,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:04,452 INFO L218 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] [2025-03-03 21:45:04,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:04,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1303653902, now seen corresponding path program 1 times [2025-03-03 21:45:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:45:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965469844] [2025-03-03 21:45:04,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:04,463 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 [2025-03-03 21:45:04,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:45:04,465 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) [2025-03-03 21:45:04,466 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 [2025-03-03 21:45:04,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 21:45:04,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 21:45:04,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:04,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:04,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:45:04,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:45:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-03-03 21:45:04,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:45:04,767 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:45:04,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965469844] [2025-03-03 21:45:04,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965469844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:45:04,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:45:04,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:45:04,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614080656] [2025-03-03 21:45:04,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:45:04,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:45:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:45:04,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:45:04,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:45:04,791 INFO L87 Difference]: Start difference. First operand has 84 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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) [2025-03-03 21:45:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:04,809 INFO L93 Difference]: Finished difference Result 162 states and 287 transitions. [2025-03-03 21:45:04,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:45:04,812 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), 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 179 [2025-03-03 21:45:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:04,818 INFO L225 Difference]: With dead ends: 162 [2025-03-03 21:45:04,818 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 21:45:04,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:45:04,823 INFO L435 NwaCegarLoop]: 126 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, 126 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 [2025-03-03 21:45:04,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:45:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 21:45:04,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 21:45:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 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) [2025-03-03 21:45:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2025-03-03 21:45:04,858 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 179 [2025-03-03 21:45:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:04,858 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2025-03-03 21:45:04,858 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), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 21:45:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2025-03-03 21:45:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 21:45:04,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:04,861 INFO L218 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] [2025-03-03 21:45:04,869 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 [2025-03-03 21:45:05,062 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 [2025-03-03 21:45:05,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:05,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:05,064 INFO L85 PathProgramCache]: Analyzing trace with hash 137998764, now seen corresponding path program 1 times [2025-03-03 21:45:05,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:45:05,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764288030] [2025-03-03 21:45:05,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:05,064 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 [2025-03-03 21:45:05,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:45:05,066 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) [2025-03-03 21:45:05,067 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 [2025-03-03 21:45:05,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 21:45:05,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 21:45:05,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:05,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:05,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:45:05,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:45:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:45:05,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:45:05,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:45:05,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764288030] [2025-03-03 21:45:05,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764288030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:45:05,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:45:05,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:45:05,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373177861] [2025-03-03 21:45:05,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:45:05,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:45:05,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:45:05,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:45:05,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:45:05,581 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 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) [2025-03-03 21:45:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:05,644 INFO L93 Difference]: Finished difference Result 226 states and 358 transitions. [2025-03-03 21:45:05,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:45:05,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 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 179 [2025-03-03 21:45:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:05,651 INFO L225 Difference]: With dead ends: 226 [2025-03-03 21:45:05,651 INFO L226 Difference]: Without dead ends: 148 [2025-03-03 21:45:05,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:45:05,654 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 29 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:45:05,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 233 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:45:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-03 21:45:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2025-03-03 21:45:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 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) [2025-03-03 21:45:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 208 transitions. [2025-03-03 21:45:05,684 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 208 transitions. Word has length 179 [2025-03-03 21:45:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:05,685 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 208 transitions. [2025-03-03 21:45:05,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 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) [2025-03-03 21:45:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 208 transitions. [2025-03-03 21:45:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 21:45:05,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:05,689 INFO L218 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] [2025-03-03 21:45:05,698 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 [2025-03-03 21:45:05,889 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 [2025-03-03 21:45:05,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:05,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:05,891 INFO L85 PathProgramCache]: Analyzing trace with hash 296662074, now seen corresponding path program 1 times [2025-03-03 21:45:05,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:45:05,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595259349] [2025-03-03 21:45:05,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:05,891 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 [2025-03-03 21:45:05,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:45:05,894 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) [2025-03-03 21:45:05,895 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 [2025-03-03 21:45:05,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 21:45:06,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 21:45:06,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:06,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:06,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:45:06,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:45:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 711 proven. 27 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2025-03-03 21:45:06,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:45:06,307 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:45:06,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595259349] [2025-03-03 21:45:06,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595259349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:45:06,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1020633448] [2025-03-03 21:45:06,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:06,307 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:45:06,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:45:06,310 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:45:06,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-03 21:45:06,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 21:45:06,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 21:45:06,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:06,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:06,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 21:45:06,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:45:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 21:45:07,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:45:07,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1020633448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:45:07,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:45:07,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 21:45:07,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38436091] [2025-03-03 21:45:07,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:45:07,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:45:07,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:45:07,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:45:07,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:45:07,104 INFO L87 Difference]: Start difference. First operand 134 states and 208 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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) [2025-03-03 21:45:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:07,308 INFO L93 Difference]: Finished difference Result 300 states and 465 transitions. [2025-03-03 21:45:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:45:07,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 180 [2025-03-03 21:45:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:07,314 INFO L225 Difference]: With dead ends: 300 [2025-03-03 21:45:07,316 INFO L226 Difference]: Without dead ends: 221 [2025-03-03 21:45:07,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:45:07,318 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 101 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:45:07,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 364 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:45:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-03 21:45:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 210. [2025-03-03 21:45:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 122 states have internal predecessors, (159), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 21:45:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 327 transitions. [2025-03-03 21:45:07,369 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 327 transitions. Word has length 180 [2025-03-03 21:45:07,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:07,372 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 327 transitions. [2025-03-03 21:45:07,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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) [2025-03-03 21:45:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 327 transitions. [2025-03-03 21:45:07,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 21:45:07,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:07,377 INFO L218 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] [2025-03-03 21:45:07,387 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 [2025-03-03 21:45:07,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-03 21:45:07,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 21:45:07,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:07,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:07,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2001545078, now seen corresponding path program 1 times [2025-03-03 21:45:07,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:45:07,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141689140] [2025-03-03 21:45:07,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:07,782 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 [2025-03-03 21:45:07,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:45:07,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:45:07,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 21:45:07,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 21:45:07,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 21:45:07,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:07,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:07,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:45:07,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:45:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 711 proven. 27 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2025-03-03 21:45:08,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:45:08,107 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:45:08,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141689140] [2025-03-03 21:45:08,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141689140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:45:08,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [128036518] [2025-03-03 21:45:08,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:08,108 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:45:08,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:45:08,110 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:45:08,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-03 21:45:08,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 21:45:08,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 21:45:08,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:08,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:08,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 21:45:08,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:45:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 814 proven. 57 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2025-03-03 21:45:09,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:45:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [128036518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:45:09,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:45:09,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 9 [2025-03-03 21:45:09,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842490542] [2025-03-03 21:45:09,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:45:09,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:45:09,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:45:09,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:45:09,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:45:09,205 INFO L87 Difference]: Start difference. First operand 210 states and 327 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-03-03 21:45:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:09,628 INFO L93 Difference]: Finished difference Result 394 states and 594 transitions. [2025-03-03 21:45:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:45:09,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 181 [2025-03-03 21:45:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:09,631 INFO L225 Difference]: With dead ends: 394 [2025-03-03 21:45:09,631 INFO L226 Difference]: Without dead ends: 240 [2025-03-03 21:45:09,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:45:09,634 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 177 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:45:09,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 287 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:45:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-03 21:45:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 234. [2025-03-03 21:45:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 140 states have (on average 1.25) internal successors, (175), 140 states have internal predecessors, (175), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 21:45:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 343 transitions. [2025-03-03 21:45:09,671 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 343 transitions. Word has length 181 [2025-03-03 21:45:09,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:09,672 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 343 transitions. [2025-03-03 21:45:09,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-03-03 21:45:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 343 transitions. [2025-03-03 21:45:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 21:45:09,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:09,673 INFO L218 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] [2025-03-03 21:45:09,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2025-03-03 21:45:09,882 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 (6)] Ended with exit code 0 [2025-03-03 21:45:10,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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 [2025-03-03 21:45:10,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:10,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:10,075 INFO L85 PathProgramCache]: Analyzing trace with hash -493993269, now seen corresponding path program 1 times [2025-03-03 21:45:10,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:45:10,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106788133] [2025-03-03 21:45:10,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:10,075 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 [2025-03-03 21:45:10,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:45:10,078 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2025-03-03 21:45:10,078 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 (8)] Waiting until timeout for monitored process [2025-03-03 21:45:10,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 21:45:10,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 21:45:10,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:10,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:10,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 21:45:10,398 INFO L279 TraceCheckSpWp]: Computing forward predicates...