./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-9.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 cd767db395d5ebca6f10e349a2ecbb93ec10053ad0321e6054a49619e1bd6f61 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:49:41,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:49:41,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:49:41,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:49:41,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:49:41,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:49:41,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:49:41,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:49:41,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:49:41,846 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:49:41,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:49:41,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:49:41,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:49:41,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:49:41,850 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:49:41,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:49:41,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:49:41,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:49:41,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:49:41,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:49:41,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:49:41,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:49:41,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:49:41,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:49:41,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:49:41,856 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:49:41,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:49:41,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:49:41,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:49:41,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:49:41,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:49:41,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:49:41,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:49:41,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:49:41,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:49:41,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:49:41,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:49:41,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:49:41,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:49:41,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:49:41,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:49:41,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:49:41,863 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 -> cd767db395d5ebca6f10e349a2ecbb93ec10053ad0321e6054a49619e1bd6f61 [2024-11-10 04:49:42,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:49:42,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:49:42,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:49:42,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:49:42,192 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:49:42,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-9.i [2024-11-10 04:49:43,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:49:43,848 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:49:43,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-9.i [2024-11-10 04:49:43,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad696bf94/97f5756c5d0f4d97acab8da1964b1722/FLAG2e461cb45 [2024-11-10 04:49:43,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad696bf94/97f5756c5d0f4d97acab8da1964b1722 [2024-11-10 04:49:43,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:49:43,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:49:43,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:49:43,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:49:43,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:49:43,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:49:43" (1/1) ... [2024-11-10 04:49:43,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1edd2bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:43, skipping insertion in model container [2024-11-10 04:49:43,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:49:43" (1/1) ... [2024-11-10 04:49:43,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:49:44,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-9.i[914,927] [2024-11-10 04:49:44,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:49:44,235 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:49:44,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-9.i[914,927] [2024-11-10 04:49:44,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:49:44,325 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:49:44,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44 WrapperNode [2024-11-10 04:49:44,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:49:44,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:49:44,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:49:44,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:49:44,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (1/1) ... [2024-11-10 04:49:44,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (1/1) ... [2024-11-10 04:49:44,388 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 283 [2024-11-10 04:49:44,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:49:44,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:49:44,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:49:44,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:49:44,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (1/1) ... [2024-11-10 04:49:44,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (1/1) ... [2024-11-10 04:49:44,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (1/1) ... [2024-11-10 04:49:44,430 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:49:44,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (1/1) ... [2024-11-10 04:49:44,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (1/1) ... [2024-11-10 04:49:44,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (1/1) ... [2024-11-10 04:49:44,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (1/1) ... [2024-11-10 04:49:44,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (1/1) ... [2024-11-10 04:49:44,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (1/1) ... [2024-11-10 04:49:44,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:49:44,455 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:49:44,455 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:49:44,455 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:49:44,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (1/1) ... [2024-11-10 04:49:44,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:49:44,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:49:44,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:49:44,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:49:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:49:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:49:44,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:49:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:49:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:49:44,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:49:44,698 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:49:44,703 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:49:45,194 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: havoc property_#t~bitwise28#1;havoc property_#t~ite30#1;havoc property_#t~bitwise29#1;havoc property_#t~bitwise31#1;havoc property_#t~short32#1; [2024-11-10 04:49:45,249 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 04:49:45,250 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:49:45,285 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:49:45,285 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:49:45,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:49:45 BoogieIcfgContainer [2024-11-10 04:49:45,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:49:45,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:49:45,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:49:45,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:49:45,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:49:43" (1/3) ... [2024-11-10 04:49:45,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1cddce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:49:45, skipping insertion in model container [2024-11-10 04:49:45,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:49:44" (2/3) ... [2024-11-10 04:49:45,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1cddce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:49:45, skipping insertion in model container [2024-11-10 04:49:45,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:49:45" (3/3) ... [2024-11-10 04:49:45,297 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-9.i [2024-11-10 04:49:45,313 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:49:45,313 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:49:45,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:49:45,396 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;@1a188883, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:49:45,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:49:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 89 states have internal predecessors, (126), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:49:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-10 04:49:45,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:49:45,428 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:49:45,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:49:45,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:49:45,435 INFO L85 PathProgramCache]: Analyzing trace with hash -137238689, now seen corresponding path program 1 times [2024-11-10 04:49:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:49:45,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690153011] [2024-11-10 04:49:45,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:49:45,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:49:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:49:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:49:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:49:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:49:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:49:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:49:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:49:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:49:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:49:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:49:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:49:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:49:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:49:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:49:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:49:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:49:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:49:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:49:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:49:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:45,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:49:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:49:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:49:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:49:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:49:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:49:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:49:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:49:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:49:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:49:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:49:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:49:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 04:49:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:49:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:49:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:49:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 04:49:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:49:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-10 04:49:46,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:49:46,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690153011] [2024-11-10 04:49:46,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690153011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:49:46,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:49:46,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:49:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675331719] [2024-11-10 04:49:46,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:49:46,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:49:46,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:49:46,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:49:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:49:46,164 INFO L87 Difference]: Start difference. First operand has 128 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 89 states have internal predecessors, (126), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-10 04:49:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:49:46,215 INFO L93 Difference]: Finished difference Result 248 states and 430 transitions. [2024-11-10 04:49:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:49:46,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) Word has length 239 [2024-11-10 04:49:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:49:46,230 INFO L225 Difference]: With dead ends: 248 [2024-11-10 04:49:46,230 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 04:49:46,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:49:46,244 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:49:46,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:49:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 04:49:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-10 04:49:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:49:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 191 transitions. [2024-11-10 04:49:46,317 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 191 transitions. Word has length 239 [2024-11-10 04:49:46,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:49:46,318 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 191 transitions. [2024-11-10 04:49:46,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-10 04:49:46,318 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 191 transitions. [2024-11-10 04:49:46,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-10 04:49:46,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:49:46,330 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:49:46,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:49:46,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:49:46,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:49:46,331 INFO L85 PathProgramCache]: Analyzing trace with hash -897406018, now seen corresponding path program 1 times [2024-11-10 04:49:46,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:49:46,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653801052] [2024-11-10 04:49:46,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:49:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:49:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:49:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:49:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:49:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:49:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:49:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:49:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:49:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:49:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:49:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:49:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:49:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:49:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:49:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:49:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:49:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:49:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:49:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:49:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:49:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:49:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:49:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:49:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:49:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:49:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:49:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:49:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:49:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:49:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:49:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:49:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:49:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 04:49:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:49:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:49:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:49:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 04:49:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:49:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-10 04:49:46,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:49:46,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653801052] [2024-11-10 04:49:46,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653801052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:49:46,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:49:46,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:49:46,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898804341] [2024-11-10 04:49:46,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:49:46,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:49:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:49:46,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:49:46,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:49:46,808 INFO L87 Difference]: Start difference. First operand 123 states and 191 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:49:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:49:46,867 INFO L93 Difference]: Finished difference Result 244 states and 381 transitions. [2024-11-10 04:49:46,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:49:46,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 239 [2024-11-10 04:49:46,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:49:46,876 INFO L225 Difference]: With dead ends: 244 [2024-11-10 04:49:46,877 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 04:49:46,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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-10 04:49:46,882 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:49:46,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:49:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 04:49:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-10 04:49:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.388235294117647) internal successors, (118), 85 states have internal predecessors, (118), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:49:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 192 transitions. [2024-11-10 04:49:46,906 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 192 transitions. Word has length 239 [2024-11-10 04:49:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:49:46,908 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 192 transitions. [2024-11-10 04:49:46,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:49:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 192 transitions. [2024-11-10 04:49:46,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-10 04:49:46,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:49:46,916 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:49:46,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:49:46,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:49:46,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:49:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash 481120942, now seen corresponding path program 1 times [2024-11-10 04:49:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:49:46,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190115065] [2024-11-10 04:49:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:49:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:49:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:49:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:49:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:49:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:49:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:49:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:49:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:49:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:49:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:49:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:49:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:49:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:49:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:49:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:49:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:49:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:49:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:49:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:49:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:49:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:49:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:49:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:49:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:49:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:49:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:49:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:49:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:49:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:49:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:49:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:49:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:49:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 04:49:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:49:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:49:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:49:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 04:49:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:49:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-10 04:49:50,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:49:50,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190115065] [2024-11-10 04:49:50,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190115065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:49:50,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:49:50,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 04:49:50,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488640386] [2024-11-10 04:49:50,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:49:50,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 04:49:50,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:49:50,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 04:49:50,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:49:50,520 INFO L87 Difference]: Start difference. First operand 124 states and 192 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:49:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:49:51,995 INFO L93 Difference]: Finished difference Result 327 states and 497 transitions. [2024-11-10 04:49:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 04:49:51,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 240 [2024-11-10 04:49:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:49:52,000 INFO L225 Difference]: With dead ends: 327 [2024-11-10 04:49:52,000 INFO L226 Difference]: Without dead ends: 206 [2024-11-10 04:49:52,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 04:49:52,004 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 97 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:49:52,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 971 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 04:49:52,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-10 04:49:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 150. [2024-11-10 04:49:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 111 states have internal predecessors, (158), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:49:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 232 transitions. [2024-11-10 04:49:52,029 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 232 transitions. Word has length 240 [2024-11-10 04:49:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:49:52,031 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 232 transitions. [2024-11-10 04:49:52,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:49:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 232 transitions. [2024-11-10 04:49:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-10 04:49:52,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:49:52,036 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:49:52,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:49:52,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:49:52,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:49:52,037 INFO L85 PathProgramCache]: Analyzing trace with hash 72296717, now seen corresponding path program 1 times [2024-11-10 04:49:52,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:49:52,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563942731] [2024-11-10 04:49:52,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:49:52,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:49:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:49:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:49:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:49:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:49:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:49:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:49:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:49:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:49:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:49:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:49:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:49:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:49:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:49:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:49:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:49:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:49:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:49:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:49:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:49:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:49:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:49:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:49:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:49:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:49:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:49:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:49:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:49:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:49:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:49:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:49:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:49:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 04:49:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:49:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:49:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:49:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 04:49:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:49:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-10 04:49:54,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:49:54,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563942731] [2024-11-10 04:49:54,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563942731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:49:54,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:49:54,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 04:49:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534673049] [2024-11-10 04:49:54,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:49:54,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 04:49:54,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:49:54,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 04:49:54,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 04:49:54,240 INFO L87 Difference]: Start difference. First operand 150 states and 232 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:49:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:49:55,181 INFO L93 Difference]: Finished difference Result 355 states and 539 transitions. [2024-11-10 04:49:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 04:49:55,182 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 240 [2024-11-10 04:49:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:49:55,186 INFO L225 Difference]: With dead ends: 355 [2024-11-10 04:49:55,186 INFO L226 Difference]: Without dead ends: 208 [2024-11-10 04:49:55,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:49:55,189 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 97 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 04:49:55,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1414 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 04:49:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-10 04:49:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 150. [2024-11-10 04:49:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 111 states have internal predecessors, (158), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:49:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 232 transitions. [2024-11-10 04:49:55,213 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 232 transitions. Word has length 240 [2024-11-10 04:49:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:49:55,214 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 232 transitions. [2024-11-10 04:49:55,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:49:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 232 transitions. [2024-11-10 04:49:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-10 04:49:55,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:49:55,219 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:49:55,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:49:55,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:49:55,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:49:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1556935347, now seen corresponding path program 1 times [2024-11-10 04:49:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:49:55,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823485227] [2024-11-10 04:49:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:49:55,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:49:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:49:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:49:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:49:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:49:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:49:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:49:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:49:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:49:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:49:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:49:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:49:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:49:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:49:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:49:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:49:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:49:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:49:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:49:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:49:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:49:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:49:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:49:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:49:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:49:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:49:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:49:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:49:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:49:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:49:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:49:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:49:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 04:49:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:49:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:49:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:49:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 04:49:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:49:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-10 04:49:56,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:49:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823485227] [2024-11-10 04:49:56,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823485227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:49:56,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:49:56,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 04:49:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535288300] [2024-11-10 04:49:56,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:49:56,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 04:49:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:49:56,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 04:49:56,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 04:49:56,395 INFO L87 Difference]: Start difference. First operand 150 states and 232 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:49:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:49:56,873 INFO L93 Difference]: Finished difference Result 355 states and 539 transitions. [2024-11-10 04:49:56,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 04:49:56,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 240 [2024-11-10 04:49:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:49:56,879 INFO L225 Difference]: With dead ends: 355 [2024-11-10 04:49:56,879 INFO L226 Difference]: Without dead ends: 208 [2024-11-10 04:49:56,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:49:56,881 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 129 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:49:56,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1072 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:49:56,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-10 04:49:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 150. [2024-11-10 04:49:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 111 states have internal predecessors, (158), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:49:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 232 transitions. [2024-11-10 04:49:56,900 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 232 transitions. Word has length 240 [2024-11-10 04:49:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:49:56,901 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 232 transitions. [2024-11-10 04:49:56,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:49:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 232 transitions. [2024-11-10 04:49:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-10 04:49:56,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:49:56,907 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:49:56,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 04:49:56,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:49:56,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:49:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1965759572, now seen corresponding path program 1 times [2024-11-10 04:49:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:49:56,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248440260] [2024-11-10 04:49:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:49:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:49:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:49:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:49:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:49:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:49:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:49:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:49:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:49:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:49:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:49:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:49:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:49:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:49:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:49:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:49:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:49:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:49:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:49:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:49:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:49:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:49:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:49:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:49:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:49:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:49:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:49:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:49:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:49:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:49:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:49:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:49:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:49:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 04:49:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:49:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:49:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:49:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 04:49:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:49:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-10 04:49:58,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:49:58,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248440260] [2024-11-10 04:49:58,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248440260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:49:58,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:49:58,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 04:49:58,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383576407] [2024-11-10 04:49:58,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:49:58,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 04:49:58,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:49:58,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 04:49:58,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 04:49:58,170 INFO L87 Difference]: Start difference. First operand 150 states and 232 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:49:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:49:58,750 INFO L93 Difference]: Finished difference Result 357 states and 541 transitions. [2024-11-10 04:49:58,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 04:49:58,751 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 240 [2024-11-10 04:49:58,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:49:58,753 INFO L225 Difference]: With dead ends: 357 [2024-11-10 04:49:58,754 INFO L226 Difference]: Without dead ends: 210 [2024-11-10 04:49:58,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:49:58,756 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 97 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 04:49:58,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1208 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 04:49:58,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-10 04:49:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 126. [2024-11-10 04:49:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:49:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 194 transitions. [2024-11-10 04:49:58,772 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 194 transitions. Word has length 240 [2024-11-10 04:49:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:49:58,773 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 194 transitions. [2024-11-10 04:49:58,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:49:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 194 transitions. [2024-11-10 04:49:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-10 04:49:58,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:49:58,776 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:49:58,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 04:49:58,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:49:58,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:49:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1347819920, now seen corresponding path program 1 times [2024-11-10 04:49:58,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:49:58,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246683585] [2024-11-10 04:49:58,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:49:58,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:49:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:49:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:49:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:49:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:49:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:49:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:49:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:49:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:49:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:49:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:49:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:49:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:49:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:49:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:49:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:49:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:49:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:49:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:49:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:49:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:49:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:49:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:49:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:49:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:49:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:49:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:49:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:49:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:49:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:49:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:49:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:49:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 04:49:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:49:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:49:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:49:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 04:49:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:49:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:49:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-10 04:49:58,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:49:58,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246683585] [2024-11-10 04:49:58,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246683585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:49:58,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:49:58,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:49:58,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635953104] [2024-11-10 04:49:58,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:49:58,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:49:58,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:49:58,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:49:58,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:49:58,935 INFO L87 Difference]: Start difference. First operand 126 states and 194 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:49:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:49:58,991 INFO L93 Difference]: Finished difference Result 367 states and 569 transitions. [2024-11-10 04:49:58,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:49:58,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 242 [2024-11-10 04:49:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:49:58,994 INFO L225 Difference]: With dead ends: 367 [2024-11-10 04:49:58,995 INFO L226 Difference]: Without dead ends: 244 [2024-11-10 04:49:58,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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-10 04:49:58,996 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 172 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:49:58,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 343 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:49:58,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-10 04:49:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 152. [2024-11-10 04:49:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 113 states have (on average 1.407079646017699) internal successors, (159), 113 states have internal predecessors, (159), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:49:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 233 transitions. [2024-11-10 04:49:59,008 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 233 transitions. Word has length 242 [2024-11-10 04:49:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:49:59,008 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 233 transitions. [2024-11-10 04:49:59,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:49:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 233 transitions. [2024-11-10 04:49:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-10 04:49:59,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:49:59,011 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:49:59,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 04:49:59,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:49:59,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:49:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1271018350, now seen corresponding path program 1 times [2024-11-10 04:49:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:49:59,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128497802] [2024-11-10 04:49:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:49:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:49:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:50:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:50:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:50:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:50:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:50:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:50:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:50:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:50:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:50:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:50:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:50:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:50:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:50:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:50:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:50:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:50:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:50:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:50:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:50:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:50:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:50:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:50:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:50:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:50:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:50:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:50:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:50:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:50:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:50:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:50:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:50:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 04:50:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:50:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:50:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:50:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 04:50:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:50:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 36 proven. 72 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-10 04:50:00,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:50:00,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128497802] [2024-11-10 04:50:00,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128497802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:50:00,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924433227] [2024-11-10 04:50:00,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:50:00,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:50:00,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:50:00,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:50:00,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 04:50:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:00,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 04:50:01,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:50:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-10 04:50:01,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:50:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924433227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:50:01,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 04:50:01,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-11-10 04:50:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935075549] [2024-11-10 04:50:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:50:01,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 04:50:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:50:01,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 04:50:01,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-10 04:50:01,206 INFO L87 Difference]: Start difference. First operand 152 states and 233 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:50:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:50:01,407 INFO L93 Difference]: Finished difference Result 350 states and 526 transitions. [2024-11-10 04:50:01,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 04:50:01,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 242 [2024-11-10 04:50:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:50:01,410 INFO L225 Difference]: With dead ends: 350 [2024-11-10 04:50:01,410 INFO L226 Difference]: Without dead ends: 201 [2024-11-10 04:50:01,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-10 04:50:01,411 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 36 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:50:01,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 799 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:50:01,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-10 04:50:01,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2024-11-10 04:50:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 155 states have (on average 1.3741935483870968) internal successors, (213), 156 states have internal predecessors, (213), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 04:50:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 291 transitions. [2024-11-10 04:50:01,425 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 291 transitions. Word has length 242 [2024-11-10 04:50:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:50:01,426 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 291 transitions. [2024-11-10 04:50:01,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:50:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 291 transitions. [2024-11-10 04:50:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-10 04:50:01,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:50:01,431 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:50:01,450 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-10 04:50:01,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:50:01,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:50:01,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:50:01,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1327558601, now seen corresponding path program 1 times [2024-11-10 04:50:01,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:50:01,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932890403] [2024-11-10 04:50:01,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:50:01,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:50:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:50:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:50:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:50:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:50:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:50:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:50:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:50:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:50:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:50:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:50:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:50:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:50:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:50:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:50:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:50:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:50:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:50:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:50:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:50:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:50:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:50:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:50:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:01,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:50:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:50:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:50:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:50:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:50:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:50:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:50:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:50:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:50:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 04:50:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:50:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:50:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:50:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 04:50:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:50:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-10 04:50:02,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:50:02,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932890403] [2024-11-10 04:50:02,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932890403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:50:02,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105761035] [2024-11-10 04:50:02,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:50:02,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:50:02,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:50:02,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:50:02,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 04:50:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:02,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 04:50:02,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:50:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 548 proven. 108 refuted. 0 times theorem prover too weak. 2008 trivial. 0 not checked. [2024-11-10 04:50:02,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:50:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-10 04:50:03,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105761035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:50:03,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:50:03,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-10 04:50:03,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56776243] [2024-11-10 04:50:03,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:50:03,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 04:50:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:50:03,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 04:50:03,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:50:03,167 INFO L87 Difference]: Start difference. First operand 197 states and 291 transitions. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 6 states have call successors, (109), 3 states have call predecessors, (109), 5 states have return successors, (110), 5 states have call predecessors, (110), 6 states have call successors, (110) [2024-11-10 04:50:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:50:03,458 INFO L93 Difference]: Finished difference Result 405 states and 590 transitions. [2024-11-10 04:50:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 04:50:03,459 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 6 states have call successors, (109), 3 states have call predecessors, (109), 5 states have return successors, (110), 5 states have call predecessors, (110), 6 states have call successors, (110) Word has length 242 [2024-11-10 04:50:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:50:03,463 INFO L225 Difference]: With dead ends: 405 [2024-11-10 04:50:03,463 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 04:50:03,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-10 04:50:03,465 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 317 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:50:03,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 313 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:50:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 04:50:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2024-11-10 04:50:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 164 states have (on average 1.3414634146341464) internal successors, (220), 165 states have internal predecessors, (220), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 04:50:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 298 transitions. [2024-11-10 04:50:03,482 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 298 transitions. Word has length 242 [2024-11-10 04:50:03,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:50:03,483 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 298 transitions. [2024-11-10 04:50:03,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 6 states have call successors, (109), 3 states have call predecessors, (109), 5 states have return successors, (110), 5 states have call predecessors, (110), 6 states have call successors, (110) [2024-11-10 04:50:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 298 transitions. [2024-11-10 04:50:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-10 04:50:03,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:50:03,487 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:50:03,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 04:50:03,687 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,SelfDestructingSolverStorable8 [2024-11-10 04:50:03,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:50:03,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:50:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash 483086730, now seen corresponding path program 1 times [2024-11-10 04:50:03,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:50:03,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664375567] [2024-11-10 04:50:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:50:03,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:50:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:50:03,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634460860] [2024-11-10 04:50:03,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:50:03,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:50:03,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:50:03,800 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:50:03,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 04:50:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:03,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 04:50:03,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:50:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 556 proven. 96 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2024-11-10 04:50:04,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:50:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-10 04:50:04,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:50:04,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664375567] [2024-11-10 04:50:04,713 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 04:50:04,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634460860] [2024-11-10 04:50:04,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634460860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:50:04,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:50:04,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-10 04:50:04,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626000663] [2024-11-10 04:50:04,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:50:04,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 04:50:04,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:50:04,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 04:50:04,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-10 04:50:04,716 INFO L87 Difference]: Start difference. First operand 209 states and 298 transitions. Second operand has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2024-11-10 04:50:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:50:05,735 INFO L93 Difference]: Finished difference Result 503 states and 690 transitions. [2024-11-10 04:50:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 04:50:05,736 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) Word has length 242 [2024-11-10 04:50:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:50:05,738 INFO L225 Difference]: With dead ends: 503 [2024-11-10 04:50:05,739 INFO L226 Difference]: Without dead ends: 297 [2024-11-10 04:50:05,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-10 04:50:05,740 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 321 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 04:50:05,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 969 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 04:50:05,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-10 04:50:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 183. [2024-11-10 04:50:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 141 states have (on average 1.3475177304964538) internal successors, (190), 141 states have internal predecessors, (190), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:50:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 264 transitions. [2024-11-10 04:50:05,759 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 264 transitions. Word has length 242 [2024-11-10 04:50:05,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:50:05,760 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 264 transitions. [2024-11-10 04:50:05,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2024-11-10 04:50:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 264 transitions. [2024-11-10 04:50:05,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-10 04:50:05,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:50:05,763 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:50:05,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 04:50:05,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:50:05,964 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:50:05,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:50:05,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1291573199, now seen corresponding path program 1 times [2024-11-10 04:50:05,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:50:05,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161419383] [2024-11-10 04:50:05,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:50:05,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:50:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:50:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:50:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:50:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:50:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:50:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:50:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:50:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:50:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:50:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:50:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:50:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:50:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:50:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:50:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:50:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:50:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:50:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:50:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:50:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:50:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:50:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:50:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:50:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:50:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:50:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:50:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:50:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:50:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:50:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:50:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:50:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 04:50:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:50:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 04:50:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:50:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 04:50:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 04:50:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-10 04:50:06,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:50:06,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161419383] [2024-11-10 04:50:06,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161419383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:50:06,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:50:06,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:50:06,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180951916] [2024-11-10 04:50:06,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:50:06,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:50:06,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:50:06,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:50:06,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:50:06,128 INFO L87 Difference]: Start difference. First operand 183 states and 264 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:50:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:50:06,189 INFO L93 Difference]: Finished difference Result 403 states and 577 transitions. [2024-11-10 04:50:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:50:06,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 243 [2024-11-10 04:50:06,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:50:06,192 INFO L225 Difference]: With dead ends: 403 [2024-11-10 04:50:06,192 INFO L226 Difference]: Without dead ends: 223 [2024-11-10 04:50:06,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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-10 04:50:06,193 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 29 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:50:06,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 339 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:50:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-10 04:50:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 188. [2024-11-10 04:50:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 146 states have internal predecessors, (195), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:50:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 269 transitions. [2024-11-10 04:50:06,209 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 269 transitions. Word has length 243 [2024-11-10 04:50:06,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:50:06,209 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 269 transitions. [2024-11-10 04:50:06,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 04:50:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 269 transitions. [2024-11-10 04:50:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-10 04:50:06,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:50:06,212 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:50:06,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 04:50:06,212 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:50:06,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:50:06,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1390309278, now seen corresponding path program 1 times [2024-11-10 04:50:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:50:06,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413185010] [2024-11-10 04:50:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:50:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:50:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:50:06,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375610929] [2024-11-10 04:50:06,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:50:06,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:50:06,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:50:06,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:50:06,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 04:50:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:50:06,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:50:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:50:06,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:50:06,922 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:50:06,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:50:06,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 04:50:07,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:50:07,129 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:50:07,289 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:50:07,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:50:07 BoogieIcfgContainer [2024-11-10 04:50:07,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:50:07,294 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:50:07,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:50:07,294 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:50:07,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:49:45" (3/4) ... [2024-11-10 04:50:07,297 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:50:07,298 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:50:07,299 INFO L158 Benchmark]: Toolchain (without parser) took 23421.77ms. Allocated memory was 172.0MB in the beginning and 463.5MB in the end (delta: 291.5MB). Free memory was 136.6MB in the beginning and 267.7MB in the end (delta: -131.1MB). Peak memory consumption was 161.4MB. Max. memory is 16.1GB. [2024-11-10 04:50:07,299 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:50:07,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.81ms. Allocated memory is still 172.0MB. Free memory was 136.6MB in the beginning and 118.7MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 04:50:07,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.86ms. Allocated memory is still 172.0MB. Free memory was 118.7MB in the beginning and 114.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:50:07,300 INFO L158 Benchmark]: Boogie Preprocessor took 64.89ms. Allocated memory is still 172.0MB. Free memory was 114.5MB in the beginning and 111.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 04:50:07,300 INFO L158 Benchmark]: IcfgBuilder took 831.10ms. Allocated memory is still 172.0MB. Free memory was 111.4MB in the beginning and 112.9MB in the end (delta: -1.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 04:50:07,301 INFO L158 Benchmark]: TraceAbstraction took 22005.27ms. Allocated memory was 172.0MB in the beginning and 463.5MB in the end (delta: 291.5MB). Free memory was 111.8MB in the beginning and 268.8MB in the end (delta: -156.9MB). Peak memory consumption was 136.7MB. Max. memory is 16.1GB. [2024-11-10 04:50:07,301 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 463.5MB. Free memory was 268.8MB in the beginning and 267.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 04:50:07,302 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.14ms. Allocated memory is still 104.9MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.81ms. Allocated memory is still 172.0MB. Free memory was 136.6MB in the beginning and 118.7MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.86ms. Allocated memory is still 172.0MB. Free memory was 118.7MB in the beginning and 114.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.89ms. Allocated memory is still 172.0MB. Free memory was 114.5MB in the beginning and 111.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 831.10ms. Allocated memory is still 172.0MB. Free memory was 111.4MB in the beginning and 112.9MB in the end (delta: -1.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22005.27ms. Allocated memory was 172.0MB in the beginning and 463.5MB in the end (delta: 291.5MB). Free memory was 111.8MB in the beginning and 268.8MB in the end (delta: -156.9MB). Peak memory consumption was 136.7MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 463.5MB. Free memory was 268.8MB in the beginning and 267.7MB 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 83, overapproximation of shiftLeft at line 207, overapproximation of someUnaryDOUBLEoperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 207. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned long int var_1_22 = 0; [L40] unsigned char var_1_23 = 64; [L41] unsigned char var_1_24 = 64; [L42] unsigned char var_1_25 = 2; [L43] unsigned short int var_1_26 = 32; [L44] unsigned long int var_1_27 = 100; [L45] unsigned short int var_1_28 = 64; [L46] float var_1_29 = 499.875; [L47] float var_1_30 = -0.2; [L48] float var_1_31 = 7.4; [L49] float var_1_32 = -0.375; [L50] float var_1_33 = 1.4; [L51] float var_1_34 = 200.4; [L52] float var_1_35 = 1.5; [L53] unsigned char var_1_36 = 0; [L54] unsigned char last_1_var_1_10 = 32; [L55] unsigned short int last_1_var_1_12 = 16; [L56] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L211] isInitial = 1 [L212] FCALL initially() [L213] COND TRUE 1 [L214] CALL updateLastVariables() [L202] last_1_var_1_10 = var_1_10 [L203] last_1_var_1_12 = var_1_12 [L204] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L214] RET updateLastVariables() [L215] CALL updateVariables() [L143] var_1_3 = __VERIFIER_nondet_short() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L146] var_1_5 = __VERIFIER_nondet_long() [L147] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L147] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L148] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L148] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L150] var_1_6 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L151] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L152] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L152] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L153] var_1_7 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L154] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L155] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L155] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L156] var_1_8 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0, var_1_9=9/5] [L157] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0, var_1_9=9/5] [L158] var_1_9 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L159] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L160] var_1_11 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L161] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L162] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L163] var_1_15 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L164] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L165] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L165] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L166] var_1_20 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L168] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L168] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L169] var_1_21 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L170] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L171] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L171] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L172] var_1_22 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L173] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L174] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L175] var_1_24 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L176] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L177] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L178] var_1_25 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L179] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L180] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L180] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L181] var_1_27 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L182] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L183] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L183] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L184] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L184] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L185] var_1_29 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L186] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L187] var_1_30 = __VERIFIER_nondet_float() [L188] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L188] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_30 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L189] RET assume_abort_if_not(var_1_30 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L190] var_1_31 = __VERIFIER_nondet_float() [L191] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L191] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L192] var_1_32 = __VERIFIER_nondet_float() [L193] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L193] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L194] CALL assume_abort_if_not(var_1_32 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L194] RET assume_abort_if_not(var_1_32 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L195] var_1_34 = __VERIFIER_nondet_float() [L196] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L196] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L197] var_1_36 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L198] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L199] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L199] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L215] RET updateVariables() [L216] CALL step() [L60] COND TRUE var_1_20 || var_1_21 [L61] var_1_19 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L63] COND FALSE !(((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) == (~ 16u)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L68] COND TRUE var_1_22 <= var_1_19 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L69] COND TRUE var_1_22 <= (((((var_1_25) < (var_1_24)) ? (var_1_25) : (var_1_24))) / var_1_27) [L70] var_1_26 = ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L83] COND FALSE !((var_1_29 / var_1_30) > ((((var_1_31 / var_1_32) < 0 ) ? -(var_1_31 / var_1_32) : (var_1_31 / var_1_32)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L88] var_1_33 = var_1_34 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L89] COND FALSE !(((256 - var_1_25) <= (var_1_28 + var_1_19)) || var_1_20) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L96] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L97] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L99] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=254, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L100] COND TRUE var_1_6 <= stepLocal_2 [L101] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L105] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L105] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L112] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L114] var_1_18 = var_1_3 [L115] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L116] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L117] COND FALSE !((- var_1_9) <= var_1_8) [L130] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L132] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L133] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L133] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L134] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L216] RET step() [L217] CALL, EXPR property() [L207] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L207] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L207] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L207] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L207] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L207-L208] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L217] RET, EXPR property() [L217] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=12, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.8s, OverallIterations: 12, TraceHistogramMax: 37, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1301 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1295 mSDsluCounter, 7974 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5937 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2892 IncrementalHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 2037 mSDtfsCounter, 2892 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2082 GetRequests, 1992 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=9, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 503 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 3861 NumberOfCodeBlocks, 3861 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3602 ConstructedInterpolants, 0 QuantifiedInterpolants, 9464 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1593 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 39372/39960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 04:50:07,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-9.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 cd767db395d5ebca6f10e349a2ecbb93ec10053ad0321e6054a49619e1bd6f61 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:50:09,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:50:09,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:50:09,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:50:09,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:50:09,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:50:09,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:50:09,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:50:09,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:50:09,632 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:50:09,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:50:09,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:50:09,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:50:09,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:50:09,634 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:50:09,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:50:09,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:50:09,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:50:09,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:50:09,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:50:09,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:50:09,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:50:09,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:50:09,637 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:50:09,637 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:50:09,637 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:50:09,638 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:50:09,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:50:09,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:50:09,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:50:09,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:50:09,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:50:09,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:50:09,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:50:09,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:50:09,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:50:09,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:50:09,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:50:09,644 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:50:09,644 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:50:09,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:50:09,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:50:09,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:50:09,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:50:09,646 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 -> cd767db395d5ebca6f10e349a2ecbb93ec10053ad0321e6054a49619e1bd6f61 [2024-11-10 04:50:09,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:50:09,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:50:09,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:50:09,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:50:09,990 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:50:09,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-9.i [2024-11-10 04:50:11,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:50:11,715 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:50:11,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-9.i [2024-11-10 04:50:11,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a6ab0d6/4ff614ae2f3d4bbb95d58be04c577b3c/FLAG7984d4e4c [2024-11-10 04:50:11,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a6ab0d6/4ff614ae2f3d4bbb95d58be04c577b3c [2024-11-10 04:50:11,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:50:11,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:50:11,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:50:11,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:50:11,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:50:11,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:50:11" (1/1) ... [2024-11-10 04:50:11,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5badcff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:11, skipping insertion in model container [2024-11-10 04:50:11,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:50:11" (1/1) ... [2024-11-10 04:50:11,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:50:11,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-9.i[914,927] [2024-11-10 04:50:12,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:50:12,087 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:50:12,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-9.i[914,927] [2024-11-10 04:50:12,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:50:12,181 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:50:12,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12 WrapperNode [2024-11-10 04:50:12,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:50:12,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:50:12,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:50:12,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:50:12,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (1/1) ... [2024-11-10 04:50:12,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (1/1) ... [2024-11-10 04:50:12,246 INFO L138 Inliner]: procedures = 27, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2024-11-10 04:50:12,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:50:12,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:50:12,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:50:12,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:50:12,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (1/1) ... [2024-11-10 04:50:12,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (1/1) ... [2024-11-10 04:50:12,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (1/1) ... [2024-11-10 04:50:12,290 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:50:12,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (1/1) ... [2024-11-10 04:50:12,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (1/1) ... [2024-11-10 04:50:12,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (1/1) ... [2024-11-10 04:50:12,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (1/1) ... [2024-11-10 04:50:12,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (1/1) ... [2024-11-10 04:50:12,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (1/1) ... [2024-11-10 04:50:12,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:50:12,314 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:50:12,314 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:50:12,314 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:50:12,315 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (1/1) ... [2024-11-10 04:50:12,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:50:12,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:50:12,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:50:12,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:50:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:50:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:50:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:50:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:50:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:50:12,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:50:12,515 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:50:12,518 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:50:16,611 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 04:50:16,611 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:50:16,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:50:16,625 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:50:16,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:50:16 BoogieIcfgContainer [2024-11-10 04:50:16,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:50:16,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:50:16,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:50:16,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:50:16,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:50:11" (1/3) ... [2024-11-10 04:50:16,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c750f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:50:16, skipping insertion in model container [2024-11-10 04:50:16,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:12" (2/3) ... [2024-11-10 04:50:16,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c750f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:50:16, skipping insertion in model container [2024-11-10 04:50:16,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:50:16" (3/3) ... [2024-11-10 04:50:16,637 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-9.i [2024-11-10 04:50:16,656 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:50:16,657 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:50:16,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:50:16,726 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;@21b03bcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:50:16,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:50:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 66 states have internal predecessors, (92), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:50:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-10 04:50:16,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:50:16,753 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:50:16,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:50:16,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:50:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1011267288, now seen corresponding path program 1 times [2024-11-10 04:50:16,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:50:16,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679137944] [2024-11-10 04:50:16,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:50:16,779 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-10 04:50:16,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:50:16,783 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-10 04:50:16,784 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-10 04:50:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:17,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:50:17,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:50:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 792 proven. 0 refuted. 0 times theorem prover too weak. 1872 trivial. 0 not checked. [2024-11-10 04:50:17,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:50:17,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:50:17,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679137944] [2024-11-10 04:50:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679137944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:50:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:50:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:50:17,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202085297] [2024-11-10 04:50:17,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:50:17,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:50:17,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:50:17,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:50:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:50:17,548 INFO L87 Difference]: Start difference. First operand has 105 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 66 states have internal predecessors, (92), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-10 04:50:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:50:17,595 INFO L93 Difference]: Finished difference Result 202 states and 362 transitions. [2024-11-10 04:50:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:50:17,598 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 231 [2024-11-10 04:50:17,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:50:17,608 INFO L225 Difference]: With dead ends: 202 [2024-11-10 04:50:17,608 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 04:50:17,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:50:17,617 INFO L432 NwaCegarLoop]: 157 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, 157 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-10 04:50:17,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:50:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 04:50:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-10 04:50:17,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 04:50:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 157 transitions. [2024-11-10 04:50:17,678 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 157 transitions. Word has length 231 [2024-11-10 04:50:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:50:17,680 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 157 transitions. [2024-11-10 04:50:17,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-10 04:50:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 157 transitions. [2024-11-10 04:50:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-10 04:50:17,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:50:17,687 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:50:17,706 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 04:50:17,887 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-10 04:50:17,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:50:17,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:50:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2053745080, now seen corresponding path program 1 times [2024-11-10 04:50:17,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:50:17,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767615400] [2024-11-10 04:50:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:50:17,890 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-10 04:50:17,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:50:17,892 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-10 04:50:17,893 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-10 04:50:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:50:18,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 04:50:18,493 INFO L278 TraceCheckSpWp]: Computing forward predicates...