./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-40.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 ff1776351702f6415e5ba3e8bd6826330be5d909403b7dc4417dfce33112b4ef --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:05:19,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:05:19,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:05:19,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:05:19,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:05:19,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:05:19,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:05:19,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:05:19,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:05:19,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:05:19,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:05:19,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:05:19,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:05:19,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:05:19,865 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:05:19,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:05:19,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:05:19,866 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:05:19,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:05:19,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:05:19,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:05:19,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:05:19,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:05:19,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:05:19,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:05:19,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:05:19,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:05:19,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:05:19,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:05:19,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:05:19,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:05:19,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:05:19,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:05:19,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:05:19,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:05:19,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:05:19,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:05:19,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:05:19,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:05:19,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:05:19,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:05:19,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:05:19,883 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff1776351702f6415e5ba3e8bd6826330be5d909403b7dc4417dfce33112b4ef [2024-11-12 04:05:20,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:05:20,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:05:20,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:05:20,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:05:20,188 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:05:20,189 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-cn_file-40.i [2024-11-12 04:05:21,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:05:21,810 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:05:21,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-40.i [2024-11-12 04:05:21,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/775dd445b/393a84d6144f4d65a48935210462036b/FLAG607e2e819 [2024-11-12 04:05:22,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/775dd445b/393a84d6144f4d65a48935210462036b [2024-11-12 04:05:22,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:05:22,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:05:22,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:05:22,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:05:22,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:05:22,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e8762d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22, skipping insertion in model container [2024-11-12 04:05:22,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:05:22,444 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-cn_file-40.i[919,932] [2024-11-12 04:05:22,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:05:22,536 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:05:22,547 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-cn_file-40.i[919,932] [2024-11-12 04:05:22,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:05:22,622 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:05:22,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22 WrapperNode [2024-11-12 04:05:22,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:05:22,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:05:22,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:05:22,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:05:22,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,746 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-12 04:05:22,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:05:22,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:05:22,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:05:22,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:05:22,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,813 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:05:22,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:05:22,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:05:22,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:05:22,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:05:22,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (1/1) ... [2024-11-12 04:05:22,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:05:22,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:05:22,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:05:22,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:05:22,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:05:22,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:05:22,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:05:22,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:05:22,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:05:22,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:05:23,059 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:05:23,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:05:23,545 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 04:05:23,546 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:05:23,563 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:05:23,565 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:05:23,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:05:23 BoogieIcfgContainer [2024-11-12 04:05:23,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:05:23,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:05:23,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:05:23,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:05:23,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:05:22" (1/3) ... [2024-11-12 04:05:23,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59dd073a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:05:23, skipping insertion in model container [2024-11-12 04:05:23,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:22" (2/3) ... [2024-11-12 04:05:23,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59dd073a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:05:23, skipping insertion in model container [2024-11-12 04:05:23,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:05:23" (3/3) ... [2024-11-12 04:05:23,577 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-40.i [2024-11-12 04:05:23,595 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:05:23,595 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:05:23,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:05:23,673 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;@490b7f39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:05:23,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:05:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 04:05:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 04:05:23,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:23,698 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:23,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:23,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:23,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2098810620, now seen corresponding path program 1 times [2024-11-12 04:05:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:05:23,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244718176] [2024-11-12 04:05:23,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:23,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:05:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:05:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:05:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:05:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:05:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:05:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:05:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:05:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:05:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:05:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:05:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:05:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:05:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:05:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:05:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:05:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:05:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:05:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:05:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:05:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:05:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:05:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:05:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:05:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:05:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:05:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:05:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:05:24,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:05:24,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244718176] [2024-11-12 04:05:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244718176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:05:24,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:05:24,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:05:24,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772421327] [2024-11-12 04:05:24,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:05:24,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:05:24,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:05:24,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:05:24,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:05:24,411 INFO L87 Difference]: Start difference. First operand has 86 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:05:24,446 INFO L93 Difference]: Finished difference Result 165 states and 288 transitions. [2024-11-12 04:05:24,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:05:24,449 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), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-12 04:05:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:05:24,457 INFO L225 Difference]: With dead ends: 165 [2024-11-12 04:05:24,458 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 04:05:24,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:05:24,465 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 [2024-11-12 04:05:24,466 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] [2024-11-12 04:05:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 04:05:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-12 04:05:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 04:05:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2024-11-12 04:05:24,513 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 173 [2024-11-12 04:05:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:05:24,518 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2024-11-12 04:05:24,518 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), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2024-11-12 04:05:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 04:05:24,524 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:24,525 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:24,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:05:24,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:24,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:24,527 INFO L85 PathProgramCache]: Analyzing trace with hash 99329031, now seen corresponding path program 1 times [2024-11-12 04:05:24,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:05:24,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764476709] [2024-11-12 04:05:24,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:05:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:05:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:05:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:05:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:05:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:05:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:05:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:05:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:05:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:05:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:05:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:05:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:05:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:05:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:05:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:05:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:05:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:05:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:05:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:05:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:05:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:05:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:05:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:05:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:05:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:05:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:05:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:05:25,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:05:25,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764476709] [2024-11-12 04:05:25,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764476709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:05:25,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:05:25,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:05:25,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790999189] [2024-11-12 04:05:25,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:05:25,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:05:25,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:05:25,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:05:25,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:05:25,279 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:05:25,531 INFO L93 Difference]: Finished difference Result 240 states and 372 transitions. [2024-11-12 04:05:25,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:05:25,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-12 04:05:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:05:25,537 INFO L225 Difference]: With dead ends: 240 [2024-11-12 04:05:25,538 INFO L226 Difference]: Without dead ends: 161 [2024-11-12 04:05:25,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:05:25,542 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 197 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:05:25,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 305 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:05:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-12 04:05:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-11-12 04:05:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 04:05:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2024-11-12 04:05:25,590 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 174 [2024-11-12 04:05:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:05:25,591 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2024-11-12 04:05:25,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2024-11-12 04:05:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 04:05:25,597 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:25,597 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:25,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:05:25,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:25,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1589614711, now seen corresponding path program 1 times [2024-11-12 04:05:25,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:05:25,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148791448] [2024-11-12 04:05:25,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:05:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:05:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:05:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:05:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:05:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:05:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:05:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:05:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:05:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:05:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:05:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:05:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:05:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:05:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:05:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:05:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:05:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:05:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:05:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:05:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:05:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:05:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:05:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:05:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:05:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:05:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:05:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:05:25,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:05:25,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148791448] [2024-11-12 04:05:25,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148791448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:05:25,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:05:25,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:05:25,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298147894] [2024-11-12 04:05:25,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:05:25,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:05:25,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:05:25,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:05:25,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:05:25,822 INFO L87 Difference]: Start difference. First operand 159 states and 247 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:05:25,892 INFO L93 Difference]: Finished difference Result 388 states and 605 transitions. [2024-11-12 04:05:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:05:25,893 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-12 04:05:25,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:05:25,896 INFO L225 Difference]: With dead ends: 388 [2024-11-12 04:05:25,896 INFO L226 Difference]: Without dead ends: 232 [2024-11-12 04:05:25,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:05:25,903 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 92 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:05:25,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 320 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:05:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-12 04:05:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 221. [2024-11-12 04:05:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 147 states have (on average 1.380952380952381) internal successors, (203), 148 states have internal predecessors, (203), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 04:05:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 343 transitions. [2024-11-12 04:05:25,942 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 343 transitions. Word has length 174 [2024-11-12 04:05:25,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:05:25,943 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 343 transitions. [2024-11-12 04:05:25,943 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:25,944 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 343 transitions. [2024-11-12 04:05:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 04:05:25,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:25,951 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:25,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:05:25,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:25,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1449066101, now seen corresponding path program 1 times [2024-11-12 04:05:25,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:05:25,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357396077] [2024-11-12 04:05:25,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:25,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:05:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:05:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:05:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:05:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:05:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:05:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:05:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:05:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:05:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:05:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:05:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:05:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:05:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:05:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:05:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:05:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:05:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:05:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:05:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:05:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:05:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:05:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:05:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:05:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:05:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:05:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:05:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:05:26,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:05:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357396077] [2024-11-12 04:05:26,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357396077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:05:26,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:05:26,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:05:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54008971] [2024-11-12 04:05:26,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:05:26,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:05:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:05:26,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:05:26,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:05:26,344 INFO L87 Difference]: Start difference. First operand 221 states and 343 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:05:26,391 INFO L93 Difference]: Finished difference Result 526 states and 820 transitions. [2024-11-12 04:05:26,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:05:26,392 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-12 04:05:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:05:26,397 INFO L225 Difference]: With dead ends: 526 [2024-11-12 04:05:26,397 INFO L226 Difference]: Without dead ends: 308 [2024-11-12 04:05:26,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:05:26,400 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 71 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:05:26,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 272 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:05:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-12 04:05:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 298. [2024-11-12 04:05:26,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 197 states have (on average 1.380710659898477) internal successors, (272), 198 states have internal predecessors, (272), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-12 04:05:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 464 transitions. [2024-11-12 04:05:26,440 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 464 transitions. Word has length 174 [2024-11-12 04:05:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:05:26,441 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 464 transitions. [2024-11-12 04:05:26,442 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 464 transitions. [2024-11-12 04:05:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 04:05:26,446 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:26,447 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:26,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:05:26,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:26,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1822091790, now seen corresponding path program 1 times [2024-11-12 04:05:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:05:26,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959824503] [2024-11-12 04:05:26,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:26,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:05:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:05:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:05:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:05:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:05:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:05:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:05:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:05:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:05:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:05:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:05:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:05:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:05:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:05:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:05:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:05:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:05:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:05:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:05:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:05:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:05:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:05:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:05:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:05:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:05:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:05:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:05:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:05:26,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:05:26,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959824503] [2024-11-12 04:05:26,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959824503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:05:26,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:05:26,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:05:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793729182] [2024-11-12 04:05:26,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:05:26,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:05:26,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:05:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:05:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:05:26,713 INFO L87 Difference]: Start difference. First operand 298 states and 464 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:05:26,777 INFO L93 Difference]: Finished difference Result 734 states and 1143 transitions. [2024-11-12 04:05:26,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:05:26,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 04:05:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:05:26,787 INFO L225 Difference]: With dead ends: 734 [2024-11-12 04:05:26,788 INFO L226 Difference]: Without dead ends: 439 [2024-11-12 04:05:26,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:05:26,790 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 70 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:05:26,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 270 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:05:26,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-12 04:05:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2024-11-12 04:05:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 290 states have (on average 1.3724137931034484) internal successors, (398), 292 states have internal predecessors, (398), 140 states have call successors, (140), 6 states have call predecessors, (140), 6 states have return successors, (140), 138 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-12 04:05:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 678 transitions. [2024-11-12 04:05:26,866 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 678 transitions. Word has length 175 [2024-11-12 04:05:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:05:26,867 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 678 transitions. [2024-11-12 04:05:26,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 678 transitions. [2024-11-12 04:05:26,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 04:05:26,869 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:26,870 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:26,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:05:26,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:26,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:26,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1273209232, now seen corresponding path program 1 times [2024-11-12 04:05:26,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:05:26,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560246796] [2024-11-12 04:05:26,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:26,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:05:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:26,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:05:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:05:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:05:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:05:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:05:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:05:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:05:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:05:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:05:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:05:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:05:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:05:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:05:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:05:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:05:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:05:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:05:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:05:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:05:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:05:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:05:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:05:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:05:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:05:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:05:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:05:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:05:27,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:05:27,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560246796] [2024-11-12 04:05:27,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560246796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:05:27,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:05:27,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:05:27,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895798187] [2024-11-12 04:05:27,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:05:27,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:05:27,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:05:27,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:05:27,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:05:27,074 INFO L87 Difference]: Start difference. First operand 437 states and 678 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:05:27,111 INFO L93 Difference]: Finished difference Result 871 states and 1353 transitions. [2024-11-12 04:05:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:05:27,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 04:05:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:05:27,116 INFO L225 Difference]: With dead ends: 871 [2024-11-12 04:05:27,117 INFO L226 Difference]: Without dead ends: 437 [2024-11-12 04:05:27,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:05:27,119 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:05:27,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:05:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-12 04:05:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-11-12 04:05:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 290 states have (on average 1.3517241379310345) internal successors, (392), 292 states have internal predecessors, (392), 140 states have call successors, (140), 6 states have call predecessors, (140), 6 states have return successors, (140), 138 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-12 04:05:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 672 transitions. [2024-11-12 04:05:27,164 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 672 transitions. Word has length 175 [2024-11-12 04:05:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:05:27,165 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 672 transitions. [2024-11-12 04:05:27,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 672 transitions. [2024-11-12 04:05:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 04:05:27,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:27,167 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:27,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:05:27,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:27,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:27,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2082555858, now seen corresponding path program 1 times [2024-11-12 04:05:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:05:27,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962552367] [2024-11-12 04:05:27,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:27,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:05:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:05:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:05:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:05:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:05:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:05:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:05:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:05:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:05:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:05:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:05:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:05:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:05:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:05:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:05:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:05:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:05:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:05:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:05:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:05:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:05:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:05:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:05:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:05:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:05:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:05:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:05:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:05:27,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:05:27,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962552367] [2024-11-12 04:05:27,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962552367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:05:27,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:05:27,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:05:27,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249633954] [2024-11-12 04:05:27,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:05:27,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:05:27,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:05:27,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:05:27,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:05:27,628 INFO L87 Difference]: Start difference. First operand 437 states and 672 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:05:27,901 INFO L93 Difference]: Finished difference Result 726 states and 1116 transitions. [2024-11-12 04:05:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:05:27,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 04:05:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:05:27,906 INFO L225 Difference]: With dead ends: 726 [2024-11-12 04:05:27,906 INFO L226 Difference]: Without dead ends: 508 [2024-11-12 04:05:27,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:05:27,908 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 175 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:05:27,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 462 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:05:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-12 04:05:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 485. [2024-11-12 04:05:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 325 states have (on average 1.353846153846154) internal successors, (440), 328 states have internal predecessors, (440), 152 states have call successors, (152), 7 states have call predecessors, (152), 7 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-12 04:05:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 744 transitions. [2024-11-12 04:05:27,959 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 744 transitions. Word has length 175 [2024-11-12 04:05:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:05:27,960 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 744 transitions. [2024-11-12 04:05:27,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 744 transitions. [2024-11-12 04:05:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 04:05:27,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:27,962 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:27,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 04:05:27,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:27,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:27,963 INFO L85 PathProgramCache]: Analyzing trace with hash 624063536, now seen corresponding path program 1 times [2024-11-12 04:05:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:05:27,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362166562] [2024-11-12 04:05:27,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:05:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:05:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:05:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:05:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:05:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:05:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:05:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:05:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:05:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:05:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:05:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:05:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:05:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:05:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:05:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:05:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:05:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:05:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:05:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:05:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:05:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:05:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:05:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:05:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:05:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:05:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:05:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:05:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:05:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362166562] [2024-11-12 04:05:28,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362166562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:05:28,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:05:28,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:05:28,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546594634] [2024-11-12 04:05:28,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:05:28,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:05:28,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:05:28,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:05:28,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:05:28,381 INFO L87 Difference]: Start difference. First operand 485 states and 744 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:05:28,641 INFO L93 Difference]: Finished difference Result 889 states and 1363 transitions. [2024-11-12 04:05:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:05:28,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 04:05:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:05:28,646 INFO L225 Difference]: With dead ends: 889 [2024-11-12 04:05:28,646 INFO L226 Difference]: Without dead ends: 622 [2024-11-12 04:05:28,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:05:28,648 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 181 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:05:28,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 526 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:05:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-12 04:05:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 543. [2024-11-12 04:05:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 370 states have (on average 1.3621621621621622) internal successors, (504), 374 states have internal predecessors, (504), 164 states have call successors, (164), 8 states have call predecessors, (164), 8 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) [2024-11-12 04:05:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 832 transitions. [2024-11-12 04:05:28,704 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 832 transitions. Word has length 175 [2024-11-12 04:05:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:05:28,705 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 832 transitions. [2024-11-12 04:05:28,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 832 transitions. [2024-11-12 04:05:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 04:05:28,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:28,707 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:28,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 04:05:28,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:28,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash 308152387, now seen corresponding path program 1 times [2024-11-12 04:05:28,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:05:28,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020009593] [2024-11-12 04:05:28,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:05:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:05:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:05:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:05:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:05:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:05:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:05:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:05:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:05:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:05:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:05:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:05:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:05:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:05:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:05:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:05:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:05:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:05:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:05:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:05:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:05:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:05:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:05:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:05:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:05:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:05:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:05:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:05:29,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:05:29,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020009593] [2024-11-12 04:05:29,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020009593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:05:29,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:05:29,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:05:29,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485928271] [2024-11-12 04:05:29,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:05:29,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:05:29,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:05:29,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:05:29,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:05:29,006 INFO L87 Difference]: Start difference. First operand 543 states and 832 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:05:29,096 INFO L93 Difference]: Finished difference Result 959 states and 1461 transitions. [2024-11-12 04:05:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:05:29,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-12 04:05:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:05:29,101 INFO L225 Difference]: With dead ends: 959 [2024-11-12 04:05:29,102 INFO L226 Difference]: Without dead ends: 686 [2024-11-12 04:05:29,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:05:29,104 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 67 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:05:29,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 299 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:05:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-12 04:05:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 638. [2024-11-12 04:05:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 439 states have (on average 1.3530751708428246) internal successors, (594), 445 states have internal predecessors, (594), 188 states have call successors, (188), 10 states have call predecessors, (188), 10 states have return successors, (188), 182 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-12 04:05:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 970 transitions. [2024-11-12 04:05:29,176 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 970 transitions. Word has length 176 [2024-11-12 04:05:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:05:29,176 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 970 transitions. [2024-11-12 04:05:29,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 970 transitions. [2024-11-12 04:05:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 04:05:29,179 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:29,179 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:29,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 04:05:29,179 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:29,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:29,180 INFO L85 PathProgramCache]: Analyzing trace with hash -112433918, now seen corresponding path program 1 times [2024-11-12 04:05:29,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:05:29,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825150829] [2024-11-12 04:05:29,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:29,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:05:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:05:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:05:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:05:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:05:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:05:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:05:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:05:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:05:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:05:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:05:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:05:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:05:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:05:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:05:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:05:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:05:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:05:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:05:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:05:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:05:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:05:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:05:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:05:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:05:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:05:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:05:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:05:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:05:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825150829] [2024-11-12 04:05:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825150829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:05:29,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:05:29,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:05:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115803105] [2024-11-12 04:05:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:05:29,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:05:29,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:05:29,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:05:29,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:05:29,624 INFO L87 Difference]: Start difference. First operand 638 states and 970 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:05:30,211 INFO L93 Difference]: Finished difference Result 1866 states and 2766 transitions. [2024-11-12 04:05:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:05:30,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-12 04:05:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:05:30,221 INFO L225 Difference]: With dead ends: 1866 [2024-11-12 04:05:30,222 INFO L226 Difference]: Without dead ends: 1231 [2024-11-12 04:05:30,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:05:30,226 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 118 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:05:30,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 529 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:05:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-12 04:05:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 968. [2024-11-12 04:05:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 669 states have (on average 1.3064275037369208) internal successors, (874), 685 states have internal predecessors, (874), 278 states have call successors, (278), 20 states have call predecessors, (278), 20 states have return successors, (278), 262 states have call predecessors, (278), 278 states have call successors, (278) [2024-11-12 04:05:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1430 transitions. [2024-11-12 04:05:30,414 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1430 transitions. Word has length 176 [2024-11-12 04:05:30,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:05:30,416 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1430 transitions. [2024-11-12 04:05:30,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:05:30,416 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1430 transitions. [2024-11-12 04:05:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 04:05:30,419 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:30,419 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:30,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 04:05:30,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:30,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:30,420 INFO L85 PathProgramCache]: Analyzing trace with hash -110586876, now seen corresponding path program 1 times [2024-11-12 04:05:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:05:30,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101382690] [2024-11-12 04:05:30,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:30,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:05:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:05:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:05:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:05:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:05:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:05:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:05:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:05:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:05:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:05:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:05:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:05:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:05:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:05:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:05:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:05:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:05:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:05:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:05:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:05:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:05:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:05:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:05:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:05:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:05:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:05:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:05:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 04:05:30,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:05:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101382690] [2024-11-12 04:05:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101382690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:05:30,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712317750] [2024-11-12 04:05:30,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:30,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:05:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:05:30,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:05:30,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:05:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:30,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 04:05:30,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:05:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 51 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-11-12 04:05:31,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:05:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 04:05:31,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712317750] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:05:31,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:05:31,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 04:05:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505585019] [2024-11-12 04:05:31,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:05:31,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:05:31,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:05:31,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:05:31,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:05:31,647 INFO L87 Difference]: Start difference. First operand 968 states and 1430 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-12 04:05:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:05:31,999 INFO L93 Difference]: Finished difference Result 1733 states and 2487 transitions. [2024-11-12 04:05:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 04:05:32,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 176 [2024-11-12 04:05:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:05:32,006 INFO L225 Difference]: With dead ends: 1733 [2024-11-12 04:05:32,007 INFO L226 Difference]: Without dead ends: 768 [2024-11-12 04:05:32,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:05:32,011 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 79 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:05:32,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 209 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:05:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-12 04:05:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 708. [2024-11-12 04:05:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 489 states have (on average 1.2351738241308794) internal successors, (604), 495 states have internal predecessors, (604), 188 states have call successors, (188), 30 states have call predecessors, (188), 30 states have return successors, (188), 182 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-12 04:05:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 980 transitions. [2024-11-12 04:05:32,180 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 980 transitions. Word has length 176 [2024-11-12 04:05:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:05:32,180 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 980 transitions. [2024-11-12 04:05:32,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-12 04:05:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 980 transitions. [2024-11-12 04:05:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 04:05:32,183 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:32,183 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:32,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 04:05:32,387 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,SelfDestructingSolverStorable10 [2024-11-12 04:05:32,388 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:32,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash 590477702, now seen corresponding path program 1 times [2024-11-12 04:05:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:05:32,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649988958] [2024-11-12 04:05:32,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:32,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:05:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:05:32,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2091052575] [2024-11-12 04:05:32,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:32,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:05:32,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:05:32,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:05:32,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 04:05:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:05:32,739 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:05:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:05:32,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:05:32,953 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:05:32,954 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:05:32,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 04:05:33,156 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,SelfDestructingSolverStorable11 [2024-11-12 04:05:33,160 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:33,309 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:05:33,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:05:33 BoogieIcfgContainer [2024-11-12 04:05:33,313 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:05:33,314 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:05:33,314 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:05:33,314 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:05:33,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:05:23" (3/4) ... [2024-11-12 04:05:33,317 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:05:33,318 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:05:33,319 INFO L158 Benchmark]: Toolchain (without parser) took 11131.40ms. Allocated memory was 142.6MB in the beginning and 339.7MB in the end (delta: 197.1MB). Free memory was 89.8MB in the beginning and 169.8MB in the end (delta: -80.0MB). Peak memory consumption was 120.2MB. Max. memory is 16.1GB. [2024-11-12 04:05:33,319 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:05:33,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.51ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 72.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 04:05:33,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.00ms. Allocated memory was 142.6MB in the beginning and 188.7MB in the end (delta: 46.1MB). Free memory was 72.1MB in the beginning and 158.4MB in the end (delta: -86.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-12 04:05:33,320 INFO L158 Benchmark]: Boogie Preprocessor took 109.03ms. Allocated memory is still 188.7MB. Free memory was 158.4MB in the beginning and 151.8MB in the end (delta: 6.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-11-12 04:05:33,320 INFO L158 Benchmark]: RCFGBuilder took 706.44ms. Allocated memory is still 188.7MB. Free memory was 151.8MB in the beginning and 122.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-12 04:05:33,321 INFO L158 Benchmark]: TraceAbstraction took 9744.88ms. Allocated memory was 188.7MB in the beginning and 339.7MB in the end (delta: 151.0MB). Free memory was 122.4MB in the beginning and 170.9MB in the end (delta: -48.5MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. [2024-11-12 04:05:33,321 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 339.7MB. Free memory was 170.9MB in the beginning and 169.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:05:33,322 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.15ms. Allocated memory is still 142.6MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.51ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 72.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.00ms. Allocated memory was 142.6MB in the beginning and 188.7MB in the end (delta: 46.1MB). Free memory was 72.1MB in the beginning and 158.4MB in the end (delta: -86.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.03ms. Allocated memory is still 188.7MB. Free memory was 158.4MB in the beginning and 151.8MB in the end (delta: 6.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * RCFGBuilder took 706.44ms. Allocated memory is still 188.7MB. Free memory was 151.8MB in the beginning and 122.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9744.88ms. Allocated memory was 188.7MB in the beginning and 339.7MB in the end (delta: 151.0MB). Free memory was 122.4MB in the beginning and 170.9MB in the end (delta: -48.5MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 339.7MB. Free memory was 170.9MB in the beginning and 169.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of bitwiseOr at line 86, overapproximation of someUnaryDOUBLEoperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 178. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned char var_1_31 = 0; [L42] unsigned char var_1_32 = 0; [L43] unsigned char var_1_33 = 8; [L44] unsigned long int var_1_34 = 50; [L45] double var_1_35 = 31.1; [L46] double var_1_36 = 127.4; [L47] unsigned long int var_1_37 = 64; [L48] signed long int var_1_38 = 8; [L49] float var_1_39 = 200.6; [L50] unsigned short int var_1_40 = 2; [L51] signed char var_1_42 = -4; [L52] double var_1_43 = 2.75; [L53] double var_1_44 = 7.6; [L54] signed char var_1_45 = 32; [L55] unsigned long int var_1_46 = 32; [L56] signed long int var_1_47 = -256; [L57] unsigned char last_1_var_1_9 = 1; [L58] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L174] last_1_var_1_9 = var_1_9 [L175] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L133] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L134] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L135] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L136] var_1_8 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_9=1] [L137] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L142] var_1_11 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L145] var_1_15 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L148] var_1_20 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L150] var_1_28 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L151] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L153] var_1_29 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L155] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L155] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L156] var_1_31 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L157] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L158] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L159] var_1_32 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L161] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L161] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L162] var_1_33 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L164] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L164] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L165] var_1_36 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L166] RET assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L167] var_1_39 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L168] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L169] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L170] var_1_44 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L171] RET assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L62] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L63] COND TRUE var_1_31 && var_1_32 [L64] var_1_30 = (((((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))) < 0 ) ? -((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))) : ((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L66] COND FALSE !(var_1_28 > var_1_30) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L71] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L72] COND FALSE !((var_1_31 && var_1_32) && (var_1_30 > var_1_34)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L75] COND FALSE !((((((var_1_36 / var_1_39)) > (var_1_35)) ? ((var_1_36 / var_1_39)) : (var_1_35))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L80] COND TRUE var_1_27 > ((var_1_29 >> 1) + var_1_37) [L81] var_1_40 = (((((var_1_33) < 0 ) ? -(var_1_33) : (var_1_33))) + ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29)))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L83] COND TRUE var_1_32 || var_1_31 [L84] var_1_42 = 1 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L86] EXPR var_1_42 | var_1_38 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L86] COND TRUE var_1_28 > (var_1_42 | var_1_38) [L87] var_1_43 = ((((var_1_36) > ((((((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) < 0 ) ? -((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) : ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))))))) ? (var_1_36) : ((((((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) < 0 ) ? -((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) : ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44)))))))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L89] var_1_45 = var_1_28 [L90] var_1_46 = var_1_33 [L91] var_1_47 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=1] [L92] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L99] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=1] [L101] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=1] [L102] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L103] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L105] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L106] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L109] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L111] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L112] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L115] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L119] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L120] var_1_25 = var_1_20 [L121] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=2, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L122] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L123] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L127] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L187] RET step() [L188] CALL, EXPR property() [L178-L179] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 12, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1057 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1050 mSDsluCounter, 3562 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1783 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 673 IncrementalHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 1779 mSDtfsCounter, 673 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 973 GetRequests, 942 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=968occurred in iteration=10, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 498 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2451 NumberOfCodeBlocks, 2451 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2262 ConstructedInterpolants, 0 QuantifiedInterpolants, 4616 SizeOfPredicates, 1 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 16747/16900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:05:33,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-40.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 ff1776351702f6415e5ba3e8bd6826330be5d909403b7dc4417dfce33112b4ef --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:05:35,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:05:35,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:05:35,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:05:35,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:05:35,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:05:35,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:05:35,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:05:35,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:05:35,852 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:05:35,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:05:35,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:05:35,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:05:35,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:05:35,856 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:05:35,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:05:35,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:05:35,857 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:05:35,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:05:35,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:05:35,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:05:35,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:05:35,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:05:35,859 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:05:35,859 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:05:35,860 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:05:35,860 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:05:35,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:05:35,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:05:35,861 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:05:35,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:05:35,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:05:35,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:05:35,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:05:35,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:05:35,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:05:35,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:05:35,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:05:35,874 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:05:35,874 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:05:35,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:05:35,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:05:35,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:05:35,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:05:35,875 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff1776351702f6415e5ba3e8bd6826330be5d909403b7dc4417dfce33112b4ef [2024-11-12 04:05:36,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:05:36,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:05:36,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:05:36,262 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:05:36,262 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:05:36,263 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-cn_file-40.i [2024-11-12 04:05:37,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:05:38,263 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:05:38,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-40.i [2024-11-12 04:05:38,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d472174/5cd6af737f8442c0a6068b31ca6b6ad1/FLAG962579724 [2024-11-12 04:05:38,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d472174/5cd6af737f8442c0a6068b31ca6b6ad1 [2024-11-12 04:05:38,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:05:38,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:05:38,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:05:38,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:05:38,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:05:38,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f9969a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38, skipping insertion in model container [2024-11-12 04:05:38,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:05:38,567 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-cn_file-40.i[919,932] [2024-11-12 04:05:38,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:05:38,697 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:05:38,712 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-cn_file-40.i[919,932] [2024-11-12 04:05:38,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:05:38,798 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:05:38,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38 WrapperNode [2024-11-12 04:05:38,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:05:38,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:05:38,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:05:38,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:05:38,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,857 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-11-12 04:05:38,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:05:38,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:05:38,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:05:38,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:05:38,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,896 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:05:38,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:05:38,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:05:38,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:05:38,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:05:38,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (1/1) ... [2024-11-12 04:05:38,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:05:38,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:05:38,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:05:38,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:05:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:05:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:05:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:05:39,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:05:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:05:39,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:05:39,163 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:05:39,166 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:05:48,602 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 04:05:48,603 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:05:48,618 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:05:48,618 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:05:48,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:05:48 BoogieIcfgContainer [2024-11-12 04:05:48,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:05:48,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:05:48,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:05:48,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:05:48,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:05:38" (1/3) ... [2024-11-12 04:05:48,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64acf699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:05:48, skipping insertion in model container [2024-11-12 04:05:48,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:05:38" (2/3) ... [2024-11-12 04:05:48,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64acf699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:05:48, skipping insertion in model container [2024-11-12 04:05:48,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:05:48" (3/3) ... [2024-11-12 04:05:48,629 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-40.i [2024-11-12 04:05:48,645 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:05:48,645 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:05:48,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:05:48,733 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;@485063e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:05:48,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:05:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 04:05:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-12 04:05:48,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:48,759 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:48,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:48,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:48,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1629278474, now seen corresponding path program 1 times [2024-11-12 04:05:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:05:48,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908878162] [2024-11-12 04:05:48,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:48,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:05:48,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:05:48,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:05:48,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:05:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:49,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:05:49,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:05:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-12 04:05:49,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:05:49,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:05:49,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908878162] [2024-11-12 04:05:49,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908878162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:05:49,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:05:49,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:05:49,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872256417] [2024-11-12 04:05:49,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:05:49,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:05:49,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:05:49,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:05:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:05:49,861 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 04:05:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:05:49,897 INFO L93 Difference]: Finished difference Result 159 states and 278 transitions. [2024-11-12 04:05:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:05:49,901 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-11-12 04:05:49,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:05:49,910 INFO L225 Difference]: With dead ends: 159 [2024-11-12 04:05:49,910 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 04:05:49,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:05:49,922 INFO L435 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:05:49,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:05:49,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 04:05:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-12 04:05:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 04:05:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-11-12 04:05:49,995 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 172 [2024-11-12 04:05:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:05:49,997 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-11-12 04:05:49,997 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 04:05:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-11-12 04:05:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 04:05:50,003 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:05:50,003 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:05:50,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 04:05:50,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:05:50,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:05:50,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:05:50,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1244735805, now seen corresponding path program 1 times [2024-11-12 04:05:50,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:05:50,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27242973] [2024-11-12 04:05:50,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:05:50,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:05:50,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:05:50,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:05:50,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:05:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:05:51,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 04:05:51,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:05:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 51 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-11-12 04:05:54,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:05:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 04:05:56,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:05:56,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27242973] [2024-11-12 04:05:56,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27242973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:05:56,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:05:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-12 04:05:56,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000666110] [2024-11-12 04:05:56,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:05:56,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 04:05:56,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:05:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 04:05:56,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:05:56,691 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-12 04:06:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:06:01,680 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2024-11-12 04:06:01,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 04:06:01,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 173 [2024-11-12 04:06:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:06:01,684 INFO L225 Difference]: With dead ends: 243 [2024-11-12 04:06:01,685 INFO L226 Difference]: Without dead ends: 167 [2024-11-12 04:06:01,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-12 04:06:01,687 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 129 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-12 04:06:01,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 416 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-12 04:06:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-12 04:06:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 81. [2024-11-12 04:06:01,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 04:06:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2024-11-12 04:06:01,719 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 173 [2024-11-12 04:06:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:06:01,720 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2024-11-12 04:06:01,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-12 04:06:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2024-11-12 04:06:01,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 04:06:01,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:06:01,725 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:06:01,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 04:06:01,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:06:01,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:06:01,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:06:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1945800383, now seen corresponding path program 1 times [2024-11-12 04:06:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:06:01,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072357895] [2024-11-12 04:06:01,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:06:01,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:06:01,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:06:01,931 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:06:01,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 04:06:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:06:02,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 04:06:02,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:06:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:06:02,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:06:02,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:06:02,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072357895] [2024-11-12 04:06:02,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072357895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:06:02,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:06:02,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:06:02,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866547924] [2024-11-12 04:06:02,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:06:02,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:06:02,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:06:02,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:06:02,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:06:02,975 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:06:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:06:03,193 INFO L93 Difference]: Finished difference Result 159 states and 233 transitions. [2024-11-12 04:06:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:06:03,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-12 04:06:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:06:03,209 INFO L225 Difference]: With dead ends: 159 [2024-11-12 04:06:03,209 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 04:06:03,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:06:03,213 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:06:03,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:06:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 04:06:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 04:06:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 04:06:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-11-12 04:06:03,227 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 173 [2024-11-12 04:06:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:06:03,228 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-11-12 04:06:03,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:06:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-11-12 04:06:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 04:06:03,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:06:03,232 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:06:03,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-12 04:06:03,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:06:03,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:06:03,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:06:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1136453757, now seen corresponding path program 1 times [2024-11-12 04:06:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:06:03,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470953956] [2024-11-12 04:06:03,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:06:03,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:06:03,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:06:03,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:06:03,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 04:06:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:06:04,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 04:06:04,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:06:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:06:05,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:06:05,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:06:05,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470953956] [2024-11-12 04:06:05,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470953956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:06:05,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:06:05,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:06:05,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946687087] [2024-11-12 04:06:05,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:06:05,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:06:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:06:05,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:06:05,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:06:05,082 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:06:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:06:07,615 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2024-11-12 04:06:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 04:06:07,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-12 04:06:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:06:07,622 INFO L225 Difference]: With dead ends: 298 [2024-11-12 04:06:07,622 INFO L226 Difference]: Without dead ends: 220 [2024-11-12 04:06:07,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:06:07,624 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 203 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:06:07,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 554 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-12 04:06:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-12 04:06:07,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 135. [2024-11-12 04:06:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 78 states have internal predecessors, (90), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 04:06:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 194 transitions. [2024-11-12 04:06:07,661 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 194 transitions. Word has length 173 [2024-11-12 04:06:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:06:07,662 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 194 transitions. [2024-11-12 04:06:07,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:06:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 194 transitions. [2024-11-12 04:06:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 04:06:07,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:06:07,669 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:06:07,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 04:06:07,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:06:07,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:06:07,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:06:07,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1138300799, now seen corresponding path program 1 times [2024-11-12 04:06:07,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:06:07,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525314273] [2024-11-12 04:06:07,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:06:07,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:06:07,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:06:07,876 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:06:07,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 04:06:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:06:08,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 04:06:08,765 INFO L279 TraceCheckSpWp]: Computing forward predicates...