./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.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 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:58:12,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:58:12,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:58:12,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:58:12,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:58:12,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:58:12,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:58:12,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:58:12,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:58:12,489 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:58:12,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:58:12,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:58:12,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:58:12,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:58:12,496 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:58:12,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:58:12,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:58:12,497 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:58:12,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:58:12,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:58:12,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:58:12,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:58:12,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:58:12,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:58:12,501 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:58:12,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:58:12,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:58:12,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:58:12,502 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:58:12,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:58:12,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:58:12,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:58:12,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:58:12,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:58:12,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:58:12,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:58:12,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:58:12,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:58:12,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:58:12,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:58:12,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:58:12,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:58:12,506 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 -> 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c [2024-11-16 12:58:12,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:58:12,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:58:12,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:58:12,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:58:12,848 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:58:12,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2024-11-16 12:58:14,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:58:14,554 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:58:14,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2024-11-16 12:58:14,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2e25259/92be296bf1784800ab3f6128031e7d91/FLAG9dd115a1c [2024-11-16 12:58:14,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2e25259/92be296bf1784800ab3f6128031e7d91 [2024-11-16 12:58:14,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:58:14,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:58:14,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:58:14,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:58:14,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:58:14,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:14,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69521c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14, skipping insertion in model container [2024-11-16 12:58:14,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:14,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:58:14,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i[914,927] [2024-11-16 12:58:14,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:58:14,937 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:58:14,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i[914,927] [2024-11-16 12:58:14,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:58:14,993 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:58:14,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14 WrapperNode [2024-11-16 12:58:14,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:58:14,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:58:14,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:58:14,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:58:15,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:15,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:15,053 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-16 12:58:15,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:58:15,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:58:15,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:58:15,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:58:15,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:15,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:15,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:15,090 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:58:15,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:15,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:15,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:15,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:15,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:15,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:15,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:58:15,115 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:58:15,115 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:58:15,115 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:58:15,116 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (1/1) ... [2024-11-16 12:58:15,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:58:15,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:58:15,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:58:15,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:58:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:58:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:58:15,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:58:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:58:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:58:15,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:58:15,340 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:58:15,342 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:58:15,696 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc property_#t~bitwise19#1;havoc property_#t~short20#1; [2024-11-16 12:58:15,735 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 12:58:15,735 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:58:15,768 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:58:15,769 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:58:15,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:58:15 BoogieIcfgContainer [2024-11-16 12:58:15,770 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:58:15,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:58:15,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:58:15,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:58:15,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:58:14" (1/3) ... [2024-11-16 12:58:15,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e23a346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:58:15, skipping insertion in model container [2024-11-16 12:58:15,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:14" (2/3) ... [2024-11-16 12:58:15,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e23a346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:58:15, skipping insertion in model container [2024-11-16 12:58:15,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:58:15" (3/3) ... [2024-11-16 12:58:15,781 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2024-11-16 12:58:15,797 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:58:15,798 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:58:15,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:58:15,880 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;@2b36f57d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:58:15,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:58:15,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:58:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 12:58:15,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:15,904 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:15,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:15,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1111645309, now seen corresponding path program 1 times [2024-11-16 12:58:15,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:58:15,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859222115] [2024-11-16 12:58:15,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:15,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:58:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:58:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:58:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:58:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:58:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:58:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:58:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:58:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:58:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:58:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:58:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:58:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:58:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:58:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:58:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:58:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:58:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:58:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:58:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:58:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:58:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:58:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:58:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:58:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:58:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:58:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:58:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:58:16,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:58:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859222115] [2024-11-16 12:58:16,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859222115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:16,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:16,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:58:16,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200034987] [2024-11-16 12:58:16,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:16,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:58:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:58:16,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:58:16,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:58:16,484 INFO L87 Difference]: Start difference. First operand has 93 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:58:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:16,533 INFO L93 Difference]: Finished difference Result 178 states and 307 transitions. [2024-11-16 12:58:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:58:16,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2024-11-16 12:58:16,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:16,547 INFO L225 Difference]: With dead ends: 178 [2024-11-16 12:58:16,547 INFO L226 Difference]: Without dead ends: 88 [2024-11-16 12:58:16,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:58:16,559 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:16,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:58:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-16 12:58:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-16 12:58:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:58:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2024-11-16 12:58:16,615 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 170 [2024-11-16 12:58:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:16,616 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2024-11-16 12:58:16,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:58:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2024-11-16 12:58:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 12:58:16,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:16,624 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:16,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:58:16,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:16,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:16,626 INFO L85 PathProgramCache]: Analyzing trace with hash 808614725, now seen corresponding path program 1 times [2024-11-16 12:58:16,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:58:16,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799948900] [2024-11-16 12:58:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:16,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:58:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:58:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:58:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:58:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:58:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:58:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:58:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:58:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:58:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:58:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:58:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:58:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:58:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:58:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:58:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:58:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:58:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:58:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:58:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:58:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:58:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:58:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:58:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:58:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:58:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:58:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:58:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:58:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:58:17,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799948900] [2024-11-16 12:58:17,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799948900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:17,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:17,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:58:17,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274525690] [2024-11-16 12:58:17,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:17,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:58:17,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:58:17,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:58:17,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:58:17,395 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:58:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:17,488 INFO L93 Difference]: Finished difference Result 258 states and 399 transitions. [2024-11-16 12:58:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:58:17,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-16 12:58:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:17,495 INFO L225 Difference]: With dead ends: 258 [2024-11-16 12:58:17,495 INFO L226 Difference]: Without dead ends: 173 [2024-11-16 12:58:17,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:58:17,499 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 74 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:17,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 264 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:58:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-16 12:58:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2024-11-16 12:58:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 115 states have internal predecessors, (157), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 12:58:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 261 transitions. [2024-11-16 12:58:17,531 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 261 transitions. Word has length 170 [2024-11-16 12:58:17,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:17,536 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 261 transitions. [2024-11-16 12:58:17,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:58:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 261 transitions. [2024-11-16 12:58:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 12:58:17,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:17,542 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:17,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:58:17,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:17,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:17,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1508278652, now seen corresponding path program 1 times [2024-11-16 12:58:17,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:58:17,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472963116] [2024-11-16 12:58:17,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:17,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:58:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:58:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:58:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:58:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:58:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:58:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:58:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:58:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:58:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:58:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:58:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:58:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:58:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:58:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:58:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:58:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:58:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:58:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:58:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:58:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:58:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:58:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:58:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:58:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:58:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:58:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:58:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:58:17,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:58:17,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472963116] [2024-11-16 12:58:17,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472963116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:17,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:17,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:58:17,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92303066] [2024-11-16 12:58:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:17,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:58:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:58:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:58:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:58:17,743 INFO L87 Difference]: Start difference. First operand 170 states and 261 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:58:17,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:17,820 INFO L93 Difference]: Finished difference Result 404 states and 617 transitions. [2024-11-16 12:58:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:58:17,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-16 12:58:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:17,826 INFO L225 Difference]: With dead ends: 404 [2024-11-16 12:58:17,826 INFO L226 Difference]: Without dead ends: 237 [2024-11-16 12:58:17,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:58:17,829 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 45 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:17,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 281 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:58:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-16 12:58:17,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 188. [2024-11-16 12:58:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 12:58:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 287 transitions. [2024-11-16 12:58:17,871 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 287 transitions. Word has length 171 [2024-11-16 12:58:17,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:17,874 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 287 transitions. [2024-11-16 12:58:17,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:58:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 287 transitions. [2024-11-16 12:58:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 12:58:17,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:17,880 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:17,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:58:17,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:17,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:17,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1284543131, now seen corresponding path program 1 times [2024-11-16 12:58:17,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:58:17,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871022482] [2024-11-16 12:58:17,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:17,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:58:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:58:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:58:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:58:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:58:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:58:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:58:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:58:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:58:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:58:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:58:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:58:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:58:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:58:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:17,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:58:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:58:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:58:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:58:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:58:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:58:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:58:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:58:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:58:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:58:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:58:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:58:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:58:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:58:18,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:58:18,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871022482] [2024-11-16 12:58:18,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871022482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:18,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:18,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:58:18,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548038307] [2024-11-16 12:58:18,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:18,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:58:18,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:58:18,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:58:18,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:58:18,027 INFO L87 Difference]: Start difference. First operand 188 states and 287 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:58:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:18,103 INFO L93 Difference]: Finished difference Result 550 states and 845 transitions. [2024-11-16 12:58:18,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:58:18,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-16 12:58:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:18,107 INFO L225 Difference]: With dead ends: 550 [2024-11-16 12:58:18,107 INFO L226 Difference]: Without dead ends: 365 [2024-11-16 12:58:18,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:58:18,109 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 119 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:18,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 354 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:58:18,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-16 12:58:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2024-11-16 12:58:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 253 states have (on average 1.3636363636363635) internal successors, (345), 253 states have internal predecessors, (345), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-16 12:58:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 553 transitions. [2024-11-16 12:58:18,159 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 553 transitions. Word has length 171 [2024-11-16 12:58:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:18,160 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 553 transitions. [2024-11-16 12:58:18,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:58:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 553 transitions. [2024-11-16 12:58:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 12:58:18,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:18,165 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:18,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:58:18,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:18,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:18,166 INFO L85 PathProgramCache]: Analyzing trace with hash -963336127, now seen corresponding path program 1 times [2024-11-16 12:58:18,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:58:18,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719464582] [2024-11-16 12:58:18,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:18,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:58:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:58:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:58:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:58:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:58:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:58:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:58:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:58:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:58:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:58:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:58:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:58:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:58:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:58:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:58:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:58:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:58:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:58:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:58:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:58:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:58:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:58:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:58:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:58:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:58:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:58:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:58:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:58:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:58:18,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719464582] [2024-11-16 12:58:18,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719464582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:18,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:18,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:58:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659899884] [2024-11-16 12:58:18,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:18,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:58:18,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:58:18,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:58:18,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:58:18,624 INFO L87 Difference]: Start difference. First operand 362 states and 553 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:58:19,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:19,243 INFO L93 Difference]: Finished difference Result 1091 states and 1671 transitions. [2024-11-16 12:58:19,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:58:19,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-11-16 12:58:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:19,252 INFO L225 Difference]: With dead ends: 1091 [2024-11-16 12:58:19,253 INFO L226 Difference]: Without dead ends: 910 [2024-11-16 12:58:19,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:58:19,256 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 324 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:19,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 544 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:58:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-16 12:58:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 896. [2024-11-16 12:58:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 625 states have (on average 1.3744) internal successors, (859), 625 states have internal predecessors, (859), 260 states have call successors, (260), 10 states have call predecessors, (260), 10 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2024-11-16 12:58:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1379 transitions. [2024-11-16 12:58:19,347 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1379 transitions. Word has length 172 [2024-11-16 12:58:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:19,347 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1379 transitions. [2024-11-16 12:58:19,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:58:19,348 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1379 transitions. [2024-11-16 12:58:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 12:58:19,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:19,350 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:19,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:58:19,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:19,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1626684385, now seen corresponding path program 1 times [2024-11-16 12:58:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:58:19,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660094104] [2024-11-16 12:58:19,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:19,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:58:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:58:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:58:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:58:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:58:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:58:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:58:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:58:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:58:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:58:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:58:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:58:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:58:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:58:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:58:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:58:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:58:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:58:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:58:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:58:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:58:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:58:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:58:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:58:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:58:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:58:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:58:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 75 proven. 69 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-16 12:58:20,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:58:20,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660094104] [2024-11-16 12:58:20,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660094104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:58:20,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11560531] [2024-11-16 12:58:20,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:20,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:58:20,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:58:20,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:58:20,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 12:58:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:21,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 12:58:21,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:58:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 848 proven. 120 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-11-16 12:58:22,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:58:23,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 87 proven. 129 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2024-11-16 12:58:23,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11560531] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:58:23,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:58:23,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 26 [2024-11-16 12:58:23,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182356700] [2024-11-16 12:58:23,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:58:23,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-16 12:58:23,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:58:23,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-16 12:58:23,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2024-11-16 12:58:23,557 INFO L87 Difference]: Start difference. First operand 896 states and 1379 transitions. Second operand has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 9 states have call successors, (64), 4 states have call predecessors, (64), 10 states have return successors, (66), 9 states have call predecessors, (66), 9 states have call successors, (66) [2024-11-16 12:58:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:25,053 INFO L93 Difference]: Finished difference Result 1880 states and 2781 transitions. [2024-11-16 12:58:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-16 12:58:25,054 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 9 states have call successors, (64), 4 states have call predecessors, (64), 10 states have return successors, (66), 9 states have call predecessors, (66), 9 states have call successors, (66) Word has length 172 [2024-11-16 12:58:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:25,060 INFO L225 Difference]: With dead ends: 1880 [2024-11-16 12:58:25,062 INFO L226 Difference]: Without dead ends: 987 [2024-11-16 12:58:25,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=680, Invalid=1576, Unknown=0, NotChecked=0, Total=2256 [2024-11-16 12:58:25,066 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 533 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:25,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 544 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 12:58:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-11-16 12:58:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 942. [2024-11-16 12:58:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 713 states have (on average 1.3366058906030855) internal successors, (953), 719 states have internal predecessors, (953), 192 states have call successors, (192), 36 states have call predecessors, (192), 36 states have return successors, (192), 186 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-16 12:58:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1337 transitions. [2024-11-16 12:58:25,184 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1337 transitions. Word has length 172 [2024-11-16 12:58:25,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:25,184 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1337 transitions. [2024-11-16 12:58:25,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 9 states have call successors, (64), 4 states have call predecessors, (64), 10 states have return successors, (66), 9 states have call predecessors, (66), 9 states have call successors, (66) [2024-11-16 12:58:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1337 transitions. [2024-11-16 12:58:25,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:58:25,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:25,188 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:25,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 12:58:25,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 12:58:25,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:25,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:25,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1641392263, now seen corresponding path program 1 times [2024-11-16 12:58:25,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:58:25,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897331890] [2024-11-16 12:58:25,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:25,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:58:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:58:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:58:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:58:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:58:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:58:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:58:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:58:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:58:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:58:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:58:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:58:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:58:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:58:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:58:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:58:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:58:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:58:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:58:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:58:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:58:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:58:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:58:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:58:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:58:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:58:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:58:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:58:25,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:58:25,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897331890] [2024-11-16 12:58:25,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897331890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:25,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:25,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 12:58:25,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709206117] [2024-11-16 12:58:25,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:25,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 12:58:25,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:58:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 12:58:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:58:25,662 INFO L87 Difference]: Start difference. First operand 942 states and 1337 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:58:25,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:25,966 INFO L93 Difference]: Finished difference Result 1426 states and 2031 transitions. [2024-11-16 12:58:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:58:25,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-16 12:58:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:25,974 INFO L225 Difference]: With dead ends: 1426 [2024-11-16 12:58:25,974 INFO L226 Difference]: Without dead ends: 953 [2024-11-16 12:58:25,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:58:25,977 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 131 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:25,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 440 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:58:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2024-11-16 12:58:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 638. [2024-11-16 12:58:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 485 states have (on average 1.3381443298969071) internal successors, (649), 489 states have internal predecessors, (649), 128 states have call successors, (128), 24 states have call predecessors, (128), 24 states have return successors, (128), 124 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-16 12:58:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 905 transitions. [2024-11-16 12:58:26,053 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 905 transitions. Word has length 173 [2024-11-16 12:58:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:26,056 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 905 transitions. [2024-11-16 12:58:26,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:58:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 905 transitions. [2024-11-16 12:58:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:58:26,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:26,059 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:26,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 12:58:26,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:26,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:26,060 INFO L85 PathProgramCache]: Analyzing trace with hash 459120994, now seen corresponding path program 1 times [2024-11-16 12:58:26,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:58:26,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705834754] [2024-11-16 12:58:26,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:26,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:58:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:58:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:58:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:58:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:58:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:58:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:58:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:58:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:58:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:58:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:58:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:58:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:58:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:58:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:58:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:58:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:58:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:58:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:58:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:58:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:58:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:58:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:58:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:58:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:58:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:58:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:58:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:58:26,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:58:26,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705834754] [2024-11-16 12:58:26,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705834754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:26,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:26,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:58:26,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260996802] [2024-11-16 12:58:26,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:26,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:58:26,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:58:26,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:58:26,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:58:26,321 INFO L87 Difference]: Start difference. First operand 638 states and 905 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:58:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:27,024 INFO L93 Difference]: Finished difference Result 1919 states and 2710 transitions. [2024-11-16 12:58:27,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:58:27,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2024-11-16 12:58:27,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:27,036 INFO L225 Difference]: With dead ends: 1919 [2024-11-16 12:58:27,037 INFO L226 Difference]: Without dead ends: 1758 [2024-11-16 12:58:27,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:58:27,042 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 346 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:27,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 479 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:58:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2024-11-16 12:58:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1536. [2024-11-16 12:58:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1155 states have (on average 1.3238095238095238) internal successors, (1529), 1165 states have internal predecessors, (1529), 320 states have call successors, (320), 60 states have call predecessors, (320), 60 states have return successors, (320), 310 states have call predecessors, (320), 320 states have call successors, (320) [2024-11-16 12:58:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2169 transitions. [2024-11-16 12:58:27,219 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2169 transitions. Word has length 173 [2024-11-16 12:58:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:27,219 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 2169 transitions. [2024-11-16 12:58:27,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:58:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2169 transitions. [2024-11-16 12:58:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:58:27,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:27,222 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:27,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 12:58:27,223 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:27,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash 661904123, now seen corresponding path program 1 times [2024-11-16 12:58:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:58:27,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277239235] [2024-11-16 12:58:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:27,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:58:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:58:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:58:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:58:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:58:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:58:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:58:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:58:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:58:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:58:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:58:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:58:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:58:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:58:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:58:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:58:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:58:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:58:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:58:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:58:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:58:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:58:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:58:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:58:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:58:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:58:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:58:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:58:27,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:58:27,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277239235] [2024-11-16 12:58:27,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277239235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:27,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:27,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:58:27,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890305182] [2024-11-16 12:58:27,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:27,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:58:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:58:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:58:27,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:58:27,612 INFO L87 Difference]: Start difference. First operand 1536 states and 2169 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:58:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:28,040 INFO L93 Difference]: Finished difference Result 3066 states and 4353 transitions. [2024-11-16 12:58:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:58:28,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-16 12:58:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:28,055 INFO L225 Difference]: With dead ends: 3066 [2024-11-16 12:58:28,055 INFO L226 Difference]: Without dead ends: 2292 [2024-11-16 12:58:28,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:58:28,061 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 203 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:28,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 497 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:58:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2024-11-16 12:58:28,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2074. [2024-11-16 12:58:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1569 states have (on average 1.3339706819630337) internal successors, (2093), 1579 states have internal predecessors, (2093), 424 states have call successors, (424), 80 states have call predecessors, (424), 80 states have return successors, (424), 414 states have call predecessors, (424), 424 states have call successors, (424) [2024-11-16 12:58:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2941 transitions. [2024-11-16 12:58:28,316 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2941 transitions. Word has length 173 [2024-11-16 12:58:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:28,316 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 2941 transitions. [2024-11-16 12:58:28,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:58:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2941 transitions. [2024-11-16 12:58:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:58:28,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:28,319 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:28,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 12:58:28,319 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:28,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash -927813783, now seen corresponding path program 1 times [2024-11-16 12:58:28,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:58:28,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804227920] [2024-11-16 12:58:28,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:58:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:58:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:58:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:58:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:58:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:58:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:58:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:58:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:58:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:58:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:58:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:58:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:58:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:58:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:58:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:58:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:58:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:58:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:58:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:58:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:58:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:58:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:58:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:58:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:58:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:58:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:58:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:58:28,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:58:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804227920] [2024-11-16 12:58:28,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804227920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:28,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:28,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 12:58:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102669535] [2024-11-16 12:58:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:28,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:58:28,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:58:28,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:58:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:58:28,876 INFO L87 Difference]: Start difference. First operand 2074 states and 2941 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:58:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:29,596 INFO L93 Difference]: Finished difference Result 4171 states and 5907 transitions. [2024-11-16 12:58:29,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:58:29,597 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2024-11-16 12:58:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:29,611 INFO L225 Difference]: With dead ends: 4171 [2024-11-16 12:58:29,612 INFO L226 Difference]: Without dead ends: 2100 [2024-11-16 12:58:29,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:58:29,619 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 349 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:29,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 576 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:58:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-11-16 12:58:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2078. [2024-11-16 12:58:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 1573 states have (on average 1.3312142403051495) internal successors, (2094), 1583 states have internal predecessors, (2094), 424 states have call successors, (424), 80 states have call predecessors, (424), 80 states have return successors, (424), 414 states have call predecessors, (424), 424 states have call successors, (424) [2024-11-16 12:58:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2942 transitions. [2024-11-16 12:58:29,884 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2942 transitions. Word has length 173 [2024-11-16 12:58:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:29,885 INFO L471 AbstractCegarLoop]: Abstraction has 2078 states and 2942 transitions. [2024-11-16 12:58:29,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:58:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2942 transitions. [2024-11-16 12:58:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 12:58:29,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:29,888 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:29,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 12:58:29,889 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:29,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:29,889 INFO L85 PathProgramCache]: Analyzing trace with hash 218124190, now seen corresponding path program 1 times [2024-11-16 12:58:29,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:58:29,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963833770] [2024-11-16 12:58:29,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:29,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:58:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:58:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:58:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:58:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:58:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:58:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:58:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:58:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:58:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:58:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:58:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:58:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:58:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:58:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:58:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:58:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:58:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:58:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:58:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:58:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:58:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:58:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:58:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:58:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:58:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:58:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 12:58:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:58:30,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:58:30,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963833770] [2024-11-16 12:58:30,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963833770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:30,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:30,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:58:30,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119890596] [2024-11-16 12:58:30,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:30,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:58:30,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:58:30,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:58:30,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:58:30,249 INFO L87 Difference]: Start difference. First operand 2078 states and 2942 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:58:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:31,023 INFO L93 Difference]: Finished difference Result 3199 states and 4547 transitions. [2024-11-16 12:58:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:58:31,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2024-11-16 12:58:31,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:31,038 INFO L225 Difference]: With dead ends: 3199 [2024-11-16 12:58:31,038 INFO L226 Difference]: Without dead ends: 2096 [2024-11-16 12:58:31,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:58:31,043 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 290 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:31,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 565 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:58:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2024-11-16 12:58:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 2070. [2024-11-16 12:58:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 1565 states have (on average 1.3303514376996806) internal successors, (2082), 1575 states have internal predecessors, (2082), 424 states have call successors, (424), 80 states have call predecessors, (424), 80 states have return successors, (424), 414 states have call predecessors, (424), 424 states have call successors, (424) [2024-11-16 12:58:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2930 transitions. [2024-11-16 12:58:31,279 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2930 transitions. Word has length 174 [2024-11-16 12:58:31,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:31,280 INFO L471 AbstractCegarLoop]: Abstraction has 2070 states and 2930 transitions. [2024-11-16 12:58:31,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:58:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2930 transitions. [2024-11-16 12:58:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 12:58:31,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:31,284 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:31,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 12:58:31,284 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:31,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1535277682, now seen corresponding path program 1 times [2024-11-16 12:58:31,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:58:31,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813618954] [2024-11-16 12:58:31,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:31,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:58:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:58:31,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819203496] [2024-11-16 12:58:31,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:31,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:58:31,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:58:31,363 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-16 12:58:31,365 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-16 12:58:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:58:31,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:58:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:58:31,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:58:31,787 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:58:31,788 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:58:31,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 12:58:31,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-16 12:58:31,995 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:32,135 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:58:32,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:58:32 BoogieIcfgContainer [2024-11-16 12:58:32,140 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:58:32,141 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:58:32,141 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:58:32,141 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:58:32,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:58:15" (3/4) ... [2024-11-16 12:58:32,144 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:58:32,145 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:58:32,145 INFO L158 Benchmark]: Toolchain (without parser) took 17536.97ms. Allocated memory was 178.3MB in the beginning and 568.3MB in the end (delta: 390.1MB). Free memory was 150.1MB in the beginning and 488.5MB in the end (delta: -338.4MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2024-11-16 12:58:32,146 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 178.3MB. Free memory was 141.9MB in the beginning and 141.7MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:58:32,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.88ms. Allocated memory is still 178.3MB. Free memory was 150.1MB in the beginning and 133.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 12:58:32,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.99ms. Allocated memory is still 178.3MB. Free memory was 133.3MB in the beginning and 129.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:58:32,146 INFO L158 Benchmark]: Boogie Preprocessor took 59.69ms. Allocated memory is still 178.3MB. Free memory was 129.1MB in the beginning and 124.0MB in the end (delta: 5.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:58:32,147 INFO L158 Benchmark]: IcfgBuilder took 655.17ms. Allocated memory is still 178.3MB. Free memory was 124.0MB in the beginning and 124.8MB in the end (delta: -839.3kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 12:58:32,147 INFO L158 Benchmark]: TraceAbstraction took 16368.39ms. Allocated memory was 178.3MB in the beginning and 568.3MB in the end (delta: 390.1MB). Free memory was 124.5MB in the beginning and 488.5MB in the end (delta: -364.0MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-11-16 12:58:32,147 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 568.3MB. Free memory is still 488.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:58:32,149 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 178.3MB. Free memory was 141.9MB in the beginning and 141.7MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.88ms. Allocated memory is still 178.3MB. Free memory was 150.1MB in the beginning and 133.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.99ms. Allocated memory is still 178.3MB. Free memory was 133.3MB in the beginning and 129.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.69ms. Allocated memory is still 178.3MB. Free memory was 129.1MB in the beginning and 124.0MB in the end (delta: 5.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 655.17ms. Allocated memory is still 178.3MB. Free memory was 124.0MB in the beginning and 124.8MB in the end (delta: -839.3kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16368.39ms. Allocated memory was 178.3MB in the beginning and 568.3MB in the end (delta: 390.1MB). Free memory was 124.5MB in the beginning and 488.5MB in the end (delta: -364.0MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 568.3MB. Free memory is still 488.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of bitwiseOr at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] unsigned long int var_1_25 = 4; [L39] unsigned short int var_1_26 = 2; [L40] unsigned short int var_1_27 = 100; [L41] signed char var_1_28 = 32; [L42] double var_1_29 = 16.25; [L43] double var_1_30 = 15.75; [L44] unsigned char var_1_31 = 0; [L45] unsigned char var_1_32 = 0; [L46] unsigned char var_1_33 = 0; [L47] unsigned char var_1_34 = 0; [L48] float var_1_35 = 7.25; [L49] float var_1_36 = 1.75; [L50] signed long int var_1_37 = 0; [L51] unsigned long int last_1_var_1_10 = 256; [L52] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=1, var_1_5=-32, var_1_6=256] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L154] last_1_var_1_10 = var_1_10 [L155] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=1, var_1_5=-32, var_1_6=256] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L112] var_1_3 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_5=-32, var_1_6=256] [L113] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_5=-32, var_1_6=256] [L114] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L114] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L115] var_1_5 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L116] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L117] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L117] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L118] var_1_13 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L119] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L120] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L120] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L121] var_1_14 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L122] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L123] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L123] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L124] var_1_15 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L125] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L126] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L126] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L127] var_1_16 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L128] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L129] var_1_21 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L130] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L131] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L131] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L132] var_1_22 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L133] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L134] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L134] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L135] var_1_25 = __VERIFIER_nondet_ulong() [L136] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L136] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L137] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L137] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L138] var_1_27 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L139] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L140] CALL assume_abort_if_not(var_1_27 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L140] RET assume_abort_if_not(var_1_27 <= 65534) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L141] var_1_30 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L142] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L143] var_1_32 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L144] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L145] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L145] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L146] var_1_33 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L147] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L148] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L148] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L149] var_1_34 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L150] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L151] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L151] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L166] RET updateVariables() [L167] CALL step() [L56] var_1_24 = var_1_25 [L57] var_1_26 = var_1_27 [L58] var_1_28 = -2 [L59] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L60] COND TRUE var_1_32 || var_1_33 [L61] var_1_31 = var_1_34 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L63] var_1_35 = var_1_30 [L64] var_1_36 = var_1_30 [L65] var_1_37 = var_1_27 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L66] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L71] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-61, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L72] COND TRUE stepLocal_2 > last_1_var_1_10 [L73] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L75] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L76] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L80] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L81] COND FALSE !(stepLocal_1 || var_1_3) [L86] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=-1, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L88] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=-1, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L99] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=-1, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L104] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=-1, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L104] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L105] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=-1, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=-1, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L158-L159] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=-1, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=-1, var_1_14=127, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=61, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.1s, OverallIterations: 12, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2414 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2414 mSDsluCounter, 4677 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3099 mSDsCounter, 1138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2239 IncrementalHoareTripleChecker+Invalid, 3377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1138 mSolverCounterUnsat, 1578 mSDtfsCounter, 2239 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1051 GetRequests, 954 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2078occurred in iteration=10, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 917 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2412 NumberOfCodeBlocks, 2412 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2223 ConstructedInterpolants, 0 QuantifiedInterpolants, 9040 SizeOfPredicates, 7 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 16582/16900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 12:58:32,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.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 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:58:34,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:58:34,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:58:34,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:58:34,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:58:34,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:58:34,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:58:34,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:58:34,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:58:34,565 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:58:34,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:58:34,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:58:34,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:58:34,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:58:34,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:58:34,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:58:34,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:58:34,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:58:34,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:58:34,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:58:34,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:58:34,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:58:34,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:58:34,575 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:58:34,575 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:58:34,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:58:34,576 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:58:34,576 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:58:34,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:58:34,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:58:34,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:58:34,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:58:34,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:58:34,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:58:34,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:58:34,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:58:34,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:58:34,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:58:34,580 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:58:34,580 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:58:34,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:58:34,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:58:34,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:58:34,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:58:34,581 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 -> 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c [2024-11-16 12:58:34,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:58:34,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:58:34,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:58:34,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:58:34,950 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:58:34,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2024-11-16 12:58:36,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:58:36,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:58:36,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2024-11-16 12:58:36,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/674e3f793/9c2b54cd875a4618bee1f376c6055f98/FLAGd97a33314 [2024-11-16 12:58:36,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/674e3f793/9c2b54cd875a4618bee1f376c6055f98 [2024-11-16 12:58:36,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:58:36,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:58:36,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:58:36,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:58:36,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:58:36,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:58:36" (1/1) ... [2024-11-16 12:58:36,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@143b5abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:36, skipping insertion in model container [2024-11-16 12:58:36,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:58:36" (1/1) ... [2024-11-16 12:58:36,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:58:37,043 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i[914,927] [2024-11-16 12:58:37,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:58:37,145 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:58:37,158 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i[914,927] [2024-11-16 12:58:37,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:58:37,227 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:58:37,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37 WrapperNode [2024-11-16 12:58:37,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:58:37,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:58:37,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:58:37,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:58:37,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (1/1) ... [2024-11-16 12:58:37,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (1/1) ... [2024-11-16 12:58:37,289 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-16 12:58:37,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:58:37,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:58:37,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:58:37,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:58:37,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (1/1) ... [2024-11-16 12:58:37,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (1/1) ... [2024-11-16 12:58:37,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (1/1) ... [2024-11-16 12:58:37,329 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:58:37,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (1/1) ... [2024-11-16 12:58:37,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (1/1) ... [2024-11-16 12:58:37,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (1/1) ... [2024-11-16 12:58:37,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (1/1) ... [2024-11-16 12:58:37,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (1/1) ... [2024-11-16 12:58:37,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (1/1) ... [2024-11-16 12:58:37,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:58:37,357 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:58:37,357 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:58:37,357 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:58:37,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (1/1) ... [2024-11-16 12:58:37,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:58:37,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:58:37,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:58:37,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:58:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:58:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:58:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:58:37,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:58:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:58:37,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:58:37,519 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:58:37,526 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:58:53,673 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 12:58:53,673 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:58:53,688 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:58:53,688 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:58:53,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:58:53 BoogieIcfgContainer [2024-11-16 12:58:53,688 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:58:53,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:58:53,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:58:53,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:58:53,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:58:36" (1/3) ... [2024-11-16 12:58:53,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fc560a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:58:53, skipping insertion in model container [2024-11-16 12:58:53,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:58:37" (2/3) ... [2024-11-16 12:58:53,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fc560a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:58:53, skipping insertion in model container [2024-11-16 12:58:53,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:58:53" (3/3) ... [2024-11-16 12:58:53,698 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-3.i [2024-11-16 12:58:53,713 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:58:53,714 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:58:53,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:58:53,780 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;@59e18ad1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:58:53,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:58:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:58:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 12:58:53,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:53,802 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:53,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:53,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:53,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1339248373, now seen corresponding path program 1 times [2024-11-16 12:58:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:58:53,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655708616] [2024-11-16 12:58:53,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:53,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:58:53,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:58:53,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:58:53,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 12:58:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:54,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:58:54,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:58:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-16 12:58:55,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:58:55,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:58:55,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655708616] [2024-11-16 12:58:55,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655708616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:55,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:55,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:58:55,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674679855] [2024-11-16 12:58:55,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:55,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:58:55,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:58:55,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:58:55,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:58:55,038 INFO L87 Difference]: Start difference. First operand has 82 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:58:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:55,065 INFO L93 Difference]: Finished difference Result 156 states and 271 transitions. [2024-11-16 12:58:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:58:55,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 167 [2024-11-16 12:58:55,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:55,075 INFO L225 Difference]: With dead ends: 156 [2024-11-16 12:58:55,075 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 12:58:55,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:58:55,084 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:55,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:58:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 12:58:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-16 12:58:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:58:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-16 12:58:55,129 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 167 [2024-11-16 12:58:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:55,129 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-16 12:58:55,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:58:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2024-11-16 12:58:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 12:58:55,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:55,134 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:58:55,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:58:55,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:58:55,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1398186381, now seen corresponding path program 1 times [2024-11-16 12:58:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:58:55,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440158612] [2024-11-16 12:58:55,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:55,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:58:55,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:58:55,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:58:55,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 12:58:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:56,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 12:58:56,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:59:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:59:00,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:59:00,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:59:00,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440158612] [2024-11-16 12:59:00,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440158612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:59:00,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:59:00,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:59:00,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100958905] [2024-11-16 12:59:00,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:59:00,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:59:00,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:59:00,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:59:00,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:59:00,394 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:59:04,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:59:08,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:59:13,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:59:16,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:59:21,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:59:25,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:59:27,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:59:28,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:59:34,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:59:38,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []