./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.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 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:29:43,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:29:43,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:29:43,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:29:43,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:29:43,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:29:43,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:29:43,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:29:43,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:29:43,805 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:29:43,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:29:43,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:29:43,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:29:43,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:29:43,806 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:29:43,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:29:43,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:29:43,807 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:29:43,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:29:43,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:29:43,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:29:43,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:29:43,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:29:43,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:29:43,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:29:43,809 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:29:43,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:29:43,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:29:43,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:29:43,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:29:43,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:29:43,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:29:43,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:29:43,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:29:43,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:29:43,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:29:43,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:29:43,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:29:43,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:29:43,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:29:43,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:29:43,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:29:43,814 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 -> 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 [2024-11-10 05:29:43,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:29:43,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:29:43,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:29:43,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:29:43,999 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:29:44,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2024-11-10 05:29:45,278 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:29:45,463 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:29:45,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2024-11-10 05:29:45,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426e57cef/39098f95300842bb8973d75f08a715df/FLAG9981346c6 [2024-11-10 05:29:45,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426e57cef/39098f95300842bb8973d75f08a715df [2024-11-10 05:29:45,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:29:45,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:29:45,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:29:45,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:29:45,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:29:45,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe82898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45, skipping insertion in model container [2024-11-10 05:29:45,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:29:45,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i[919,932] [2024-11-10 05:29:45,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:29:45,741 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:29:45,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i[919,932] [2024-11-10 05:29:45,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:29:45,808 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:29:45,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45 WrapperNode [2024-11-10 05:29:45,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:29:45,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:29:45,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:29:45,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:29:45,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,882 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2024-11-10 05:29:45,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:29:45,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:29:45,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:29:45,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:29:45,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,921 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:29:45,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,955 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:45,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:29:45,988 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:29:45,988 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:29:45,988 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:29:45,989 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (1/1) ... [2024-11-10 05:29:46,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:29:46,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:29:46,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 05:29:46,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 05:29:46,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:29:46,093 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:29:46,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:29:46,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:29:46,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:29:46,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:29:46,182 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:29:46,184 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:29:46,595 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L182: havoc property_#t~bitwise22#1;havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2024-11-10 05:29:46,639 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 05:29:46,639 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:29:46,666 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:29:46,666 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:29:46,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:29:46 BoogieIcfgContainer [2024-11-10 05:29:46,667 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:29:46,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:29:46,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:29:46,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:29:46,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:29:45" (1/3) ... [2024-11-10 05:29:46,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673e16e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:29:46, skipping insertion in model container [2024-11-10 05:29:46,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:29:45" (2/3) ... [2024-11-10 05:29:46,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673e16e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:29:46, skipping insertion in model container [2024-11-10 05:29:46,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:29:46" (3/3) ... [2024-11-10 05:29:46,674 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2024-11-10 05:29:46,688 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:29:46,689 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:29:46,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:29:46,747 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;@6948ee84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:29:46,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:29:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 77 states have internal predecessors, (111), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:29:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 05:29:46,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:46,764 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:46,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:46,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash 97313309, now seen corresponding path program 1 times [2024-11-10 05:29:46,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:46,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480299740] [2024-11-10 05:29:46,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:46,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:47,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:47,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480299740] [2024-11-10 05:29:47,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480299740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:47,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:47,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:29:47,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264836541] [2024-11-10 05:29:47,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:47,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:29:47,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:47,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:29:47,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:29:47,291 INFO L87 Difference]: Start difference. First operand has 101 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 77 states have internal predecessors, (111), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 05:29:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:47,390 INFO L93 Difference]: Finished difference Result 194 states and 325 transitions. [2024-11-10 05:29:47,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:29:47,393 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 160 [2024-11-10 05:29:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:47,408 INFO L225 Difference]: With dead ends: 194 [2024-11-10 05:29:47,409 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 05:29:47,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:29:47,418 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:47,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:29:47,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 05:29:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 05:29:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:29:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2024-11-10 05:29:47,453 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 160 [2024-11-10 05:29:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:47,454 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2024-11-10 05:29:47,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 05:29:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2024-11-10 05:29:47,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 05:29:47,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:47,457 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:47,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:29:47,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:47,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1558923037, now seen corresponding path program 1 times [2024-11-10 05:29:47,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:47,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756723812] [2024-11-10 05:29:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:47,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:47,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756723812] [2024-11-10 05:29:47,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756723812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:47,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:47,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:29:47,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787727311] [2024-11-10 05:29:47,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:47,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:29:47,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:47,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:29:47,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:29:47,764 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:47,841 INFO L93 Difference]: Finished difference Result 238 states and 367 transitions. [2024-11-10 05:29:47,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:29:47,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-10 05:29:47,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:47,844 INFO L225 Difference]: With dead ends: 238 [2024-11-10 05:29:47,846 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 05:29:47,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:29:47,848 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 60 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:47,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 295 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:29:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 05:29:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2024-11-10 05:29:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 94 states have internal predecessors, (139), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:29:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 183 transitions. [2024-11-10 05:29:47,863 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 183 transitions. Word has length 160 [2024-11-10 05:29:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:47,864 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 183 transitions. [2024-11-10 05:29:47,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 183 transitions. [2024-11-10 05:29:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 05:29:47,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:47,867 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:47,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:29:47,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:47,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:47,868 INFO L85 PathProgramCache]: Analyzing trace with hash -852045565, now seen corresponding path program 1 times [2024-11-10 05:29:47,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:47,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603945726] [2024-11-10 05:29:47,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:47,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:48,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:48,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603945726] [2024-11-10 05:29:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603945726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:48,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:48,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:29:48,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051531108] [2024-11-10 05:29:48,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:48,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:29:48,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:48,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:29:48,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:29:48,270 INFO L87 Difference]: Start difference. First operand 118 states and 183 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:48,575 INFO L93 Difference]: Finished difference Result 365 states and 560 transitions. [2024-11-10 05:29:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:29:48,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-10 05:29:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:48,581 INFO L225 Difference]: With dead ends: 365 [2024-11-10 05:29:48,581 INFO L226 Difference]: Without dead ends: 250 [2024-11-10 05:29:48,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:29:48,582 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 262 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:48,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 411 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:29:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-10 05:29:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 138. [2024-11-10 05:29:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.4912280701754386) internal successors, (170), 114 states have internal predecessors, (170), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:29:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 214 transitions. [2024-11-10 05:29:48,606 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 214 transitions. Word has length 160 [2024-11-10 05:29:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:48,607 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 214 transitions. [2024-11-10 05:29:48,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 214 transitions. [2024-11-10 05:29:48,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 05:29:48,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:48,612 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:48,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:29:48,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:48,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:48,612 INFO L85 PathProgramCache]: Analyzing trace with hash -710542651, now seen corresponding path program 1 times [2024-11-10 05:29:48,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:48,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053230980] [2024-11-10 05:29:48,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:48,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:48,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053230980] [2024-11-10 05:29:48,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053230980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:48,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:48,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:29:48,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588392899] [2024-11-10 05:29:48,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:48,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:29:48,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:48,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:29:48,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:29:48,991 INFO L87 Difference]: Start difference. First operand 138 states and 214 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:49,159 INFO L93 Difference]: Finished difference Result 393 states and 613 transitions. [2024-11-10 05:29:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:29:49,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2024-11-10 05:29:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:49,162 INFO L225 Difference]: With dead ends: 393 [2024-11-10 05:29:49,164 INFO L226 Difference]: Without dead ends: 247 [2024-11-10 05:29:49,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:29:49,165 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 254 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:49,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 251 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:29:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-10 05:29:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 181. [2024-11-10 05:29:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 157 states have (on average 1.4968152866242037) internal successors, (235), 157 states have internal predecessors, (235), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:29:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 279 transitions. [2024-11-10 05:29:49,192 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 279 transitions. Word has length 161 [2024-11-10 05:29:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:49,193 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 279 transitions. [2024-11-10 05:29:49,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 279 transitions. [2024-11-10 05:29:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 05:29:49,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:49,198 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:49,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:29:49,198 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:49,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1728800764, now seen corresponding path program 1 times [2024-11-10 05:29:49,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:49,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258463081] [2024-11-10 05:29:49,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:49,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:49,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:49,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258463081] [2024-11-10 05:29:49,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258463081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:49,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:49,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:29:49,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182741804] [2024-11-10 05:29:49,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:49,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:29:49,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:49,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:29:49,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:29:49,329 INFO L87 Difference]: Start difference. First operand 181 states and 279 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:49,394 INFO L93 Difference]: Finished difference Result 416 states and 636 transitions. [2024-11-10 05:29:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:29:49,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2024-11-10 05:29:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:49,397 INFO L225 Difference]: With dead ends: 416 [2024-11-10 05:29:49,397 INFO L226 Difference]: Without dead ends: 238 [2024-11-10 05:29:49,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:29:49,398 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 105 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:49,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 271 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:29:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-10 05:29:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 181. [2024-11-10 05:29:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 157 states have (on average 1.484076433121019) internal successors, (233), 157 states have internal predecessors, (233), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:29:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 277 transitions. [2024-11-10 05:29:49,414 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 277 transitions. Word has length 161 [2024-11-10 05:29:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:49,414 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 277 transitions. [2024-11-10 05:29:49,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 277 transitions. [2024-11-10 05:29:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:29:49,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:49,416 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:49,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:29:49,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:49,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1346988273, now seen corresponding path program 1 times [2024-11-10 05:29:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:49,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702713771] [2024-11-10 05:29:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:49,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:49,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:49,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702713771] [2024-11-10 05:29:49,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702713771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:49,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:49,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:29:49,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938271987] [2024-11-10 05:29:49,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:49,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:29:49,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:49,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:29:49,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:29:49,526 INFO L87 Difference]: Start difference. First operand 181 states and 277 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:49,588 INFO L93 Difference]: Finished difference Result 435 states and 662 transitions. [2024-11-10 05:29:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:29:49,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2024-11-10 05:29:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:49,590 INFO L225 Difference]: With dead ends: 435 [2024-11-10 05:29:49,590 INFO L226 Difference]: Without dead ends: 257 [2024-11-10 05:29:49,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:29:49,592 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 127 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:49,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 271 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:29:49,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-10 05:29:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 195. [2024-11-10 05:29:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 171 states have (on average 1.4678362573099415) internal successors, (251), 171 states have internal predecessors, (251), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:29:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 295 transitions. [2024-11-10 05:29:49,607 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 295 transitions. Word has length 162 [2024-11-10 05:29:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:49,607 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 295 transitions. [2024-11-10 05:29:49,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 295 transitions. [2024-11-10 05:29:49,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:29:49,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:49,609 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:49,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 05:29:49,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:49,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:49,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2075805697, now seen corresponding path program 1 times [2024-11-10 05:29:49,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:49,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369994120] [2024-11-10 05:29:49,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:49,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:49,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:49,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369994120] [2024-11-10 05:29:49,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369994120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:49,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:49,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:29:49,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7507102] [2024-11-10 05:29:49,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:49,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:29:49,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:49,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:29:49,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:29:49,843 INFO L87 Difference]: Start difference. First operand 195 states and 295 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:50,128 INFO L93 Difference]: Finished difference Result 573 states and 869 transitions. [2024-11-10 05:29:50,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:29:50,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2024-11-10 05:29:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:50,130 INFO L225 Difference]: With dead ends: 573 [2024-11-10 05:29:50,131 INFO L226 Difference]: Without dead ends: 381 [2024-11-10 05:29:50,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:29:50,131 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 229 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:50,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 567 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:29:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-10 05:29:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 269. [2024-11-10 05:29:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 245 states have (on average 1.506122448979592) internal successors, (369), 245 states have internal predecessors, (369), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:29:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 413 transitions. [2024-11-10 05:29:50,149 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 413 transitions. Word has length 162 [2024-11-10 05:29:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:50,149 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 413 transitions. [2024-11-10 05:29:50,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 413 transitions. [2024-11-10 05:29:50,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:29:50,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:50,151 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:50,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 05:29:50,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:50,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash 278854338, now seen corresponding path program 1 times [2024-11-10 05:29:50,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:50,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363548484] [2024-11-10 05:29:50,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:50,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:50,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:50,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363548484] [2024-11-10 05:29:50,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363548484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:50,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:50,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 05:29:50,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978565745] [2024-11-10 05:29:50,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:50,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 05:29:50,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:50,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 05:29:50,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:29:50,557 INFO L87 Difference]: Start difference. First operand 269 states and 413 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:51,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:51,297 INFO L93 Difference]: Finished difference Result 729 states and 1105 transitions. [2024-11-10 05:29:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 05:29:51,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2024-11-10 05:29:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:51,300 INFO L225 Difference]: With dead ends: 729 [2024-11-10 05:29:51,300 INFO L226 Difference]: Without dead ends: 462 [2024-11-10 05:29:51,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-10 05:29:51,302 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 417 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:51,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 918 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 05:29:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-10 05:29:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 292. [2024-11-10 05:29:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 268 states have (on average 1.4888059701492538) internal successors, (399), 268 states have internal predecessors, (399), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:29:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 443 transitions. [2024-11-10 05:29:51,336 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 443 transitions. Word has length 162 [2024-11-10 05:29:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:51,336 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 443 transitions. [2024-11-10 05:29:51,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 443 transitions. [2024-11-10 05:29:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:29:51,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:51,339 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:51,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 05:29:51,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:51,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1403646, now seen corresponding path program 1 times [2024-11-10 05:29:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:51,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536163366] [2024-11-10 05:29:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:51,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:51,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:51,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536163366] [2024-11-10 05:29:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536163366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:51,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:51,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:29:51,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175837616] [2024-11-10 05:29:51,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:51,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:29:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:51,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:29:51,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:29:51,731 INFO L87 Difference]: Start difference. First operand 292 states and 443 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 05:29:51,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:51,954 INFO L93 Difference]: Finished difference Result 789 states and 1196 transitions. [2024-11-10 05:29:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:29:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 162 [2024-11-10 05:29:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:51,958 INFO L225 Difference]: With dead ends: 789 [2024-11-10 05:29:51,959 INFO L226 Difference]: Without dead ends: 500 [2024-11-10 05:29:51,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:29:51,959 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 133 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:51,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 598 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:29:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-10 05:29:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 497. [2024-11-10 05:29:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 450 states have (on average 1.46) internal successors, (657), 450 states have internal predecessors, (657), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 05:29:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 745 transitions. [2024-11-10 05:29:52,003 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 745 transitions. Word has length 162 [2024-11-10 05:29:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:52,003 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 745 transitions. [2024-11-10 05:29:52,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 05:29:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 745 transitions. [2024-11-10 05:29:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 05:29:52,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:52,005 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:52,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 05:29:52,005 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:52,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:52,006 INFO L85 PathProgramCache]: Analyzing trace with hash -68410399, now seen corresponding path program 1 times [2024-11-10 05:29:52,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:52,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977966487] [2024-11-10 05:29:52,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:52,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:52,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:52,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977966487] [2024-11-10 05:29:52,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977966487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:52,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:52,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 05:29:52,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288672442] [2024-11-10 05:29:52,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:52,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 05:29:52,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:52,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 05:29:52,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:29:52,696 INFO L87 Difference]: Start difference. First operand 497 states and 745 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:53,018 INFO L93 Difference]: Finished difference Result 1136 states and 1691 transitions. [2024-11-10 05:29:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:29:53,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2024-11-10 05:29:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:53,021 INFO L225 Difference]: With dead ends: 1136 [2024-11-10 05:29:53,021 INFO L226 Difference]: Without dead ends: 642 [2024-11-10 05:29:53,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:29:53,023 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 88 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:53,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1215 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:29:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-10 05:29:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 535. [2024-11-10 05:29:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 488 states have (on average 1.444672131147541) internal successors, (705), 488 states have internal predecessors, (705), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 05:29:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 793 transitions. [2024-11-10 05:29:53,102 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 793 transitions. Word has length 162 [2024-11-10 05:29:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:53,103 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 793 transitions. [2024-11-10 05:29:53,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 793 transitions. [2024-11-10 05:29:53,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 05:29:53,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:53,105 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:53,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 05:29:53,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:53,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:53,106 INFO L85 PathProgramCache]: Analyzing trace with hash -544081676, now seen corresponding path program 1 times [2024-11-10 05:29:53,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:53,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189528299] [2024-11-10 05:29:53,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:53,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:53,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:53,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189528299] [2024-11-10 05:29:53,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189528299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:53,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:53,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 05:29:53,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873132911] [2024-11-10 05:29:53,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:53,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 05:29:53,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:53,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 05:29:53,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:29:53,885 INFO L87 Difference]: Start difference. First operand 535 states and 793 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:54,367 INFO L93 Difference]: Finished difference Result 1749 states and 2574 transitions. [2024-11-10 05:29:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 05:29:54,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2024-11-10 05:29:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:54,373 INFO L225 Difference]: With dead ends: 1749 [2024-11-10 05:29:54,373 INFO L226 Difference]: Without dead ends: 1437 [2024-11-10 05:29:54,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:29:54,374 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 624 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:54,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 380 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:29:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2024-11-10 05:29:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1018. [2024-11-10 05:29:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 965 states have (on average 1.4642487046632124) internal successors, (1413), 967 states have internal predecessors, (1413), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 05:29:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1509 transitions. [2024-11-10 05:29:54,454 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1509 transitions. Word has length 163 [2024-11-10 05:29:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:54,455 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1509 transitions. [2024-11-10 05:29:54,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1509 transitions. [2024-11-10 05:29:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 05:29:54,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:54,458 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:54,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 05:29:54,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:54,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:54,459 INFO L85 PathProgramCache]: Analyzing trace with hash -952905901, now seen corresponding path program 1 times [2024-11-10 05:29:54,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:54,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441602615] [2024-11-10 05:29:54,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:54,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:54,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441602615] [2024-11-10 05:29:54,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441602615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:54,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:54,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:29:54,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155322925] [2024-11-10 05:29:54,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:54,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:29:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:54,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:29:54,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:29:54,669 INFO L87 Difference]: Start difference. First operand 1018 states and 1509 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:55,176 INFO L93 Difference]: Finished difference Result 2104 states and 3115 transitions. [2024-11-10 05:29:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:29:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2024-11-10 05:29:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:55,183 INFO L225 Difference]: With dead ends: 2104 [2024-11-10 05:29:55,183 INFO L226 Difference]: Without dead ends: 1494 [2024-11-10 05:29:55,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:29:55,185 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 216 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:55,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 470 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 05:29:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2024-11-10 05:29:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1096. [2024-11-10 05:29:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1043 states have (on average 1.4582933844678811) internal successors, (1521), 1045 states have internal predecessors, (1521), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 05:29:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1617 transitions. [2024-11-10 05:29:55,250 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1617 transitions. Word has length 163 [2024-11-10 05:29:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:55,251 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1617 transitions. [2024-11-10 05:29:55,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1617 transitions. [2024-11-10 05:29:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 05:29:55,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:55,253 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:55,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 05:29:55,253 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:55,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:55,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1337373484, now seen corresponding path program 1 times [2024-11-10 05:29:55,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:55,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946075358] [2024-11-10 05:29:55,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:55,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:55,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:55,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946075358] [2024-11-10 05:29:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946075358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:55,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:55,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:29:55,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591880696] [2024-11-10 05:29:55,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:55,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:29:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:55,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:29:55,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:29:55,687 INFO L87 Difference]: Start difference. First operand 1096 states and 1617 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:56,829 INFO L93 Difference]: Finished difference Result 3295 states and 4836 transitions. [2024-11-10 05:29:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 05:29:56,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2024-11-10 05:29:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:56,837 INFO L225 Difference]: With dead ends: 3295 [2024-11-10 05:29:56,837 INFO L226 Difference]: Without dead ends: 2202 [2024-11-10 05:29:56,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:29:56,840 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 415 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:56,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 811 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 05:29:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2024-11-10 05:29:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 1630. [2024-11-10 05:29:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1525 states have (on average 1.4314754098360656) internal successors, (2183), 1529 states have internal predecessors, (2183), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 05:29:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2375 transitions. [2024-11-10 05:29:56,991 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2375 transitions. Word has length 163 [2024-11-10 05:29:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:56,991 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2375 transitions. [2024-11-10 05:29:56,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2375 transitions. [2024-11-10 05:29:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 05:29:56,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:56,993 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:56,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 05:29:56,994 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:56,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1197845299, now seen corresponding path program 1 times [2024-11-10 05:29:56,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:56,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511011443] [2024-11-10 05:29:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:56,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:57,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:57,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511011443] [2024-11-10 05:29:57,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511011443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:57,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:57,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:29:57,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901174917] [2024-11-10 05:29:57,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:57,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:29:57,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:57,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:29:57,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:29:57,319 INFO L87 Difference]: Start difference. First operand 1630 states and 2375 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 05:29:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:57,706 INFO L93 Difference]: Finished difference Result 3248 states and 4729 transitions. [2024-11-10 05:29:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:29:57,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 163 [2024-11-10 05:29:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:57,712 INFO L225 Difference]: With dead ends: 3248 [2024-11-10 05:29:57,713 INFO L226 Difference]: Without dead ends: 1621 [2024-11-10 05:29:57,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:29:57,716 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 251 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:57,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 469 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:29:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2024-11-10 05:29:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1618. [2024-11-10 05:29:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1513 states have (on average 1.4256444150693985) internal successors, (2157), 1517 states have internal predecessors, (2157), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 05:29:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2349 transitions. [2024-11-10 05:29:57,843 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2349 transitions. Word has length 163 [2024-11-10 05:29:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:57,843 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2349 transitions. [2024-11-10 05:29:57,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 05:29:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2349 transitions. [2024-11-10 05:29:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 05:29:57,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:57,845 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:57,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 05:29:57,846 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:57,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:57,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1298906309, now seen corresponding path program 1 times [2024-11-10 05:29:57,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:57,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321221136] [2024-11-10 05:29:57,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:57,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:29:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:29:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:29:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:29:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:29:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:29:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:29:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:29:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:29:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:29:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:29:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:29:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:29:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:29:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:29:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:29:58,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:58,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321221136] [2024-11-10 05:29:58,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321221136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:58,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:58,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 05:29:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412491752] [2024-11-10 05:29:58,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:58,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 05:29:58,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:58,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 05:29:58,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-10 05:29:58,529 INFO L87 Difference]: Start difference. First operand 1618 states and 2349 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:59,522 INFO L93 Difference]: Finished difference Result 4075 states and 5734 transitions. [2024-11-10 05:29:59,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 05:29:59,523 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2024-11-10 05:29:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:59,532 INFO L225 Difference]: With dead ends: 4075 [2024-11-10 05:29:59,532 INFO L226 Difference]: Without dead ends: 2460 [2024-11-10 05:29:59,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-10 05:29:59,535 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 350 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:59,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1464 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 05:29:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2024-11-10 05:29:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 1684. [2024-11-10 05:29:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1579 states have (on average 1.358454718176061) internal successors, (2145), 1583 states have internal predecessors, (2145), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 05:29:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2337 transitions. [2024-11-10 05:29:59,639 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2337 transitions. Word has length 163 [2024-11-10 05:29:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:59,640 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2337 transitions. [2024-11-10 05:29:59,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:29:59,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2337 transitions. [2024-11-10 05:29:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 05:29:59,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:59,642 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:59,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 05:29:59,642 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:59,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:59,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1049668132, now seen corresponding path program 1 times [2024-11-10 05:29:59,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:59,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936161325] [2024-11-10 05:29:59,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:59,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:00,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:00,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936161325] [2024-11-10 05:30:00,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936161325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:00,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:00,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 05:30:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445253757] [2024-11-10 05:30:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:00,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 05:30:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:00,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 05:30:00,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 05:30:00,293 INFO L87 Difference]: Start difference. First operand 1684 states and 2337 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:01,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:01,567 INFO L93 Difference]: Finished difference Result 3846 states and 5274 transitions. [2024-11-10 05:30:01,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 05:30:01,568 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2024-11-10 05:30:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:01,574 INFO L225 Difference]: With dead ends: 3846 [2024-11-10 05:30:01,575 INFO L226 Difference]: Without dead ends: 2165 [2024-11-10 05:30:01,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-11-10 05:30:01,578 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 428 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:01,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1527 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 05:30:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2024-11-10 05:30:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1728. [2024-11-10 05:30:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1623 states have (on average 1.3622920517560073) internal successors, (2211), 1627 states have internal predecessors, (2211), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 05:30:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2403 transitions. [2024-11-10 05:30:01,721 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2403 transitions. Word has length 163 [2024-11-10 05:30:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:01,721 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2403 transitions. [2024-11-10 05:30:01,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2403 transitions. [2024-11-10 05:30:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 05:30:01,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:01,725 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:01,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 05:30:01,725 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:01,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash 310830143, now seen corresponding path program 1 times [2024-11-10 05:30:01,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:01,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338752429] [2024-11-10 05:30:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:01,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:02,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:02,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338752429] [2024-11-10 05:30:02,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338752429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:02,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:02,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 05:30:02,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38790045] [2024-11-10 05:30:02,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:02,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 05:30:02,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:02,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 05:30:02,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-10 05:30:02,571 INFO L87 Difference]: Start difference. First operand 1728 states and 2403 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:03,705 INFO L93 Difference]: Finished difference Result 4320 states and 5876 transitions. [2024-11-10 05:30:03,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 05:30:03,705 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 164 [2024-11-10 05:30:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:03,713 INFO L225 Difference]: With dead ends: 4320 [2024-11-10 05:30:03,713 INFO L226 Difference]: Without dead ends: 2595 [2024-11-10 05:30:03,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2024-11-10 05:30:03,717 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 583 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:03,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1536 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 05:30:03,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2024-11-10 05:30:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 1728. [2024-11-10 05:30:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1623 states have (on average 1.363524337646334) internal successors, (2213), 1627 states have internal predecessors, (2213), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 05:30:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2405 transitions. [2024-11-10 05:30:03,843 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2405 transitions. Word has length 164 [2024-11-10 05:30:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:03,843 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2405 transitions. [2024-11-10 05:30:03,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:03,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2405 transitions. [2024-11-10 05:30:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 05:30:03,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:03,846 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:03,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 05:30:03,846 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:03,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:03,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1194551970, now seen corresponding path program 1 times [2024-11-10 05:30:03,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:03,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633164545] [2024-11-10 05:30:03,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:04,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:04,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633164545] [2024-11-10 05:30:04,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633164545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:04,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:04,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 05:30:04,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811076559] [2024-11-10 05:30:04,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:04,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 05:30:04,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:04,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 05:30:04,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-10 05:30:04,489 INFO L87 Difference]: Start difference. First operand 1728 states and 2405 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:05,546 INFO L93 Difference]: Finished difference Result 3978 states and 5459 transitions. [2024-11-10 05:30:05,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 05:30:05,550 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 164 [2024-11-10 05:30:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:05,556 INFO L225 Difference]: With dead ends: 3978 [2024-11-10 05:30:05,557 INFO L226 Difference]: Without dead ends: 2253 [2024-11-10 05:30:05,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2024-11-10 05:30:05,560 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 434 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:05,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1677 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 05:30:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2024-11-10 05:30:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1720. [2024-11-10 05:30:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1615 states have (on average 1.3628482972136222) internal successors, (2201), 1619 states have internal predecessors, (2201), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 05:30:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2393 transitions. [2024-11-10 05:30:05,653 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2393 transitions. Word has length 164 [2024-11-10 05:30:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:05,653 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2393 transitions. [2024-11-10 05:30:05,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2393 transitions. [2024-11-10 05:30:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 05:30:05,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:05,655 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:05,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 05:30:05,656 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:05,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:05,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1393799183, now seen corresponding path program 1 times [2024-11-10 05:30:05,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:05,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040747149] [2024-11-10 05:30:05,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:05,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:05,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:05,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040747149] [2024-11-10 05:30:05,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040747149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:05,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:05,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:30:05,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119887812] [2024-11-10 05:30:05,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:05,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:30:05,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:05,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:30:05,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:30:05,831 INFO L87 Difference]: Start difference. First operand 1720 states and 2393 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:06,221 INFO L93 Difference]: Finished difference Result 3524 states and 4951 transitions. [2024-11-10 05:30:06,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:30:06,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 164 [2024-11-10 05:30:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:06,229 INFO L225 Difference]: With dead ends: 3524 [2024-11-10 05:30:06,229 INFO L226 Difference]: Without dead ends: 1807 [2024-11-10 05:30:06,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:30:06,232 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 249 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:06,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 472 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:30:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2024-11-10 05:30:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1368. [2024-11-10 05:30:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 1263 states have (on average 1.3578780680918447) internal successors, (1715), 1267 states have internal predecessors, (1715), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 05:30:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1907 transitions. [2024-11-10 05:30:06,330 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1907 transitions. Word has length 164 [2024-11-10 05:30:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:06,330 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 1907 transitions. [2024-11-10 05:30:06,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1907 transitions. [2024-11-10 05:30:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 05:30:06,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:06,333 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:06,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 05:30:06,333 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:06,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash 164351222, now seen corresponding path program 1 times [2024-11-10 05:30:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:06,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351261800] [2024-11-10 05:30:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:07,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:07,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351261800] [2024-11-10 05:30:07,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351261800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:07,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:07,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 05:30:07,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014407475] [2024-11-10 05:30:07,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:07,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 05:30:07,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:07,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 05:30:07,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:30:07,035 INFO L87 Difference]: Start difference. First operand 1368 states and 1907 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:07,491 INFO L93 Difference]: Finished difference Result 2581 states and 3573 transitions. [2024-11-10 05:30:07,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 05:30:07,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 164 [2024-11-10 05:30:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:07,498 INFO L225 Difference]: With dead ends: 2581 [2024-11-10 05:30:07,498 INFO L226 Difference]: Without dead ends: 1804 [2024-11-10 05:30:07,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:30:07,500 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 347 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:07,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 494 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:30:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2024-11-10 05:30:07,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1436. [2024-11-10 05:30:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1331 states have (on average 1.3531179564237414) internal successors, (1801), 1335 states have internal predecessors, (1801), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 05:30:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1993 transitions. [2024-11-10 05:30:07,603 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1993 transitions. Word has length 164 [2024-11-10 05:30:07,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:07,603 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 1993 transitions. [2024-11-10 05:30:07,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1993 transitions. [2024-11-10 05:30:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 05:30:07,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:07,605 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:07,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 05:30:07,605 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:07,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1108711595, now seen corresponding path program 1 times [2024-11-10 05:30:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:07,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072219503] [2024-11-10 05:30:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:07,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:07,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:07,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072219503] [2024-11-10 05:30:07,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072219503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:07,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:07,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 05:30:07,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659220252] [2024-11-10 05:30:07,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:07,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 05:30:07,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:07,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 05:30:07,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:30:07,868 INFO L87 Difference]: Start difference. First operand 1436 states and 1993 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:08,325 INFO L93 Difference]: Finished difference Result 3556 states and 4812 transitions. [2024-11-10 05:30:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 05:30:08,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 164 [2024-11-10 05:30:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:08,333 INFO L225 Difference]: With dead ends: 3556 [2024-11-10 05:30:08,333 INFO L226 Difference]: Without dead ends: 2123 [2024-11-10 05:30:08,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:30:08,336 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 113 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:08,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 955 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:30:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2024-11-10 05:30:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1528. [2024-11-10 05:30:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1423 states have (on average 1.3450456781447646) internal successors, (1914), 1427 states have internal predecessors, (1914), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 05:30:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2106 transitions. [2024-11-10 05:30:08,431 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2106 transitions. Word has length 164 [2024-11-10 05:30:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:08,431 INFO L471 AbstractCegarLoop]: Abstraction has 1528 states and 2106 transitions. [2024-11-10 05:30:08,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2106 transitions. [2024-11-10 05:30:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 05:30:08,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:08,433 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:08,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 05:30:08,433 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:08,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:08,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1342108950, now seen corresponding path program 1 times [2024-11-10 05:30:08,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:08,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247622108] [2024-11-10 05:30:08,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:08,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:08,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:08,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247622108] [2024-11-10 05:30:08,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247622108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:08,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:08,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:30:08,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283791637] [2024-11-10 05:30:08,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:08,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:30:08,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:08,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:30:08,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:30:08,584 INFO L87 Difference]: Start difference. First operand 1528 states and 2106 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:09,156 INFO L93 Difference]: Finished difference Result 3354 states and 4648 transitions. [2024-11-10 05:30:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:30:09,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 164 [2024-11-10 05:30:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:09,163 INFO L225 Difference]: With dead ends: 3354 [2024-11-10 05:30:09,164 INFO L226 Difference]: Without dead ends: 1829 [2024-11-10 05:30:09,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:30:09,166 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 327 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:09,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 525 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 05:30:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2024-11-10 05:30:09,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1394. [2024-11-10 05:30:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1289 states have (on average 1.3397982932505819) internal successors, (1727), 1293 states have internal predecessors, (1727), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 92 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 05:30:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1919 transitions. [2024-11-10 05:30:09,258 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1919 transitions. Word has length 164 [2024-11-10 05:30:09,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:09,258 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1919 transitions. [2024-11-10 05:30:09,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1919 transitions. [2024-11-10 05:30:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 05:30:09,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:09,260 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:09,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 05:30:09,260 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:09,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:09,261 INFO L85 PathProgramCache]: Analyzing trace with hash 50584450, now seen corresponding path program 1 times [2024-11-10 05:30:09,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:09,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002090800] [2024-11-10 05:30:09,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:09,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:09,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:09,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002090800] [2024-11-10 05:30:09,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002090800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:09,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:09,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:30:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29409410] [2024-11-10 05:30:09,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:09,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:30:09,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:09,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:30:09,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:30:09,654 INFO L87 Difference]: Start difference. First operand 1394 states and 1919 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:09,939 INFO L93 Difference]: Finished difference Result 2836 states and 3887 transitions. [2024-11-10 05:30:09,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:30:09,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 164 [2024-11-10 05:30:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:09,947 INFO L225 Difference]: With dead ends: 2836 [2024-11-10 05:30:09,947 INFO L226 Difference]: Without dead ends: 1438 [2024-11-10 05:30:09,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:30:09,952 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 214 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:09,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 397 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:30:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-11-10 05:30:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1417. [2024-11-10 05:30:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1300 states have (on average 1.3292307692307692) internal successors, (1728), 1306 states have internal predecessors, (1728), 104 states have call successors, (104), 12 states have call predecessors, (104), 12 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-10 05:30:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1936 transitions. [2024-11-10 05:30:10,066 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1936 transitions. Word has length 164 [2024-11-10 05:30:10,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:10,067 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 1936 transitions. [2024-11-10 05:30:10,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1936 transitions. [2024-11-10 05:30:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 05:30:10,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:10,068 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:10,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 05:30:10,069 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:10,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1166461213, now seen corresponding path program 1 times [2024-11-10 05:30:10,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:10,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986216706] [2024-11-10 05:30:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:10,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:10,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986216706] [2024-11-10 05:30:10,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986216706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:10,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:10,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 05:30:10,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523605353] [2024-11-10 05:30:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:10,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 05:30:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:10,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 05:30:10,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:30:10,351 INFO L87 Difference]: Start difference. First operand 1417 states and 1936 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:11,144 INFO L93 Difference]: Finished difference Result 3064 states and 4195 transitions. [2024-11-10 05:30:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 05:30:11,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 164 [2024-11-10 05:30:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:11,150 INFO L225 Difference]: With dead ends: 3064 [2024-11-10 05:30:11,150 INFO L226 Difference]: Without dead ends: 1643 [2024-11-10 05:30:11,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-10 05:30:11,152 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 391 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:11,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 975 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 05:30:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2024-11-10 05:30:11,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1433. [2024-11-10 05:30:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1292 states have (on average 1.3273993808049536) internal successors, (1715), 1299 states have internal predecessors, (1715), 126 states have call successors, (126), 14 states have call predecessors, (126), 14 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-10 05:30:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1967 transitions. [2024-11-10 05:30:11,282 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1967 transitions. Word has length 164 [2024-11-10 05:30:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:11,283 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 1967 transitions. [2024-11-10 05:30:11,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:11,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1967 transitions. [2024-11-10 05:30:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 05:30:11,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:11,284 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:11,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 05:30:11,285 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:11,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:11,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1076076449, now seen corresponding path program 1 times [2024-11-10 05:30:11,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:11,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159064628] [2024-11-10 05:30:11,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:11,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:11,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159064628] [2024-11-10 05:30:11,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159064628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:11,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:11,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:30:11,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051082105] [2024-11-10 05:30:11,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:11,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:30:11,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:11,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:30:11,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:30:11,447 INFO L87 Difference]: Start difference. First operand 1433 states and 1967 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:12,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:12,035 INFO L93 Difference]: Finished difference Result 3367 states and 4655 transitions. [2024-11-10 05:30:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:30:12,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 164 [2024-11-10 05:30:12,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:12,040 INFO L225 Difference]: With dead ends: 3367 [2024-11-10 05:30:12,040 INFO L226 Difference]: Without dead ends: 1983 [2024-11-10 05:30:12,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:30:12,043 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 184 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:12,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 596 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:30:12,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2024-11-10 05:30:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1973. [2024-11-10 05:30:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1973 states, 1763 states have (on average 1.3312535450935905) internal successors, (2347), 1770 states have internal predecessors, (2347), 192 states have call successors, (192), 17 states have call predecessors, (192), 17 states have return successors, (192), 185 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-10 05:30:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 2731 transitions. [2024-11-10 05:30:12,225 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 2731 transitions. Word has length 164 [2024-11-10 05:30:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:12,226 INFO L471 AbstractCegarLoop]: Abstraction has 1973 states and 2731 transitions. [2024-11-10 05:30:12,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2731 transitions. [2024-11-10 05:30:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 05:30:12,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:12,227 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:12,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 05:30:12,228 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:12,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1955053001, now seen corresponding path program 1 times [2024-11-10 05:30:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681191636] [2024-11-10 05:30:12,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:12,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:12,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:12,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681191636] [2024-11-10 05:30:12,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681191636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:12,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:12,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 05:30:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063206740] [2024-11-10 05:30:12,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:12,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 05:30:12,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:12,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 05:30:12,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-10 05:30:12,931 INFO L87 Difference]: Start difference. First operand 1973 states and 2731 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:14,219 INFO L93 Difference]: Finished difference Result 3630 states and 4862 transitions. [2024-11-10 05:30:14,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 05:30:14,220 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 165 [2024-11-10 05:30:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:14,225 INFO L225 Difference]: With dead ends: 3630 [2024-11-10 05:30:14,225 INFO L226 Difference]: Without dead ends: 2834 [2024-11-10 05:30:14,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2024-11-10 05:30:14,227 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 581 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:14,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1221 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 05:30:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2024-11-10 05:30:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 1997. [2024-11-10 05:30:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1787 states have (on average 1.3312814773363177) internal successors, (2379), 1794 states have internal predecessors, (2379), 192 states have call successors, (192), 17 states have call predecessors, (192), 17 states have return successors, (192), 185 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-10 05:30:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2763 transitions. [2024-11-10 05:30:14,536 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2763 transitions. Word has length 165 [2024-11-10 05:30:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:14,537 INFO L471 AbstractCegarLoop]: Abstraction has 1997 states and 2763 transitions. [2024-11-10 05:30:14,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2763 transitions. [2024-11-10 05:30:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 05:30:14,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:14,539 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:14,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 05:30:14,539 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:14,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1083347510, now seen corresponding path program 1 times [2024-11-10 05:30:14,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:14,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898285925] [2024-11-10 05:30:14,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:14,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:15,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:15,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898285925] [2024-11-10 05:30:15,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898285925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:15,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:15,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 05:30:15,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600917953] [2024-11-10 05:30:15,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:15,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 05:30:15,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:15,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 05:30:15,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:30:15,093 INFO L87 Difference]: Start difference. First operand 1997 states and 2763 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:15,905 INFO L93 Difference]: Finished difference Result 3070 states and 4221 transitions. [2024-11-10 05:30:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 05:30:15,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 165 [2024-11-10 05:30:15,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:15,911 INFO L225 Difference]: With dead ends: 3070 [2024-11-10 05:30:15,911 INFO L226 Difference]: Without dead ends: 2250 [2024-11-10 05:30:15,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:30:15,913 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 364 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:15,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 418 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 05:30:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2024-11-10 05:30:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2009. [2024-11-10 05:30:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2009 states, 1799 states have (on average 1.3357420789327403) internal successors, (2403), 1806 states have internal predecessors, (2403), 192 states have call successors, (192), 17 states have call predecessors, (192), 17 states have return successors, (192), 185 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-10 05:30:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 2787 transitions. [2024-11-10 05:30:16,113 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 2787 transitions. Word has length 165 [2024-11-10 05:30:16,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:16,114 INFO L471 AbstractCegarLoop]: Abstraction has 2009 states and 2787 transitions. [2024-11-10 05:30:16,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2787 transitions. [2024-11-10 05:30:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 05:30:16,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:16,118 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:16,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 05:30:16,118 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:16,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1036383883, now seen corresponding path program 1 times [2024-11-10 05:30:16,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:16,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532196505] [2024-11-10 05:30:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:16,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:16,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:16,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532196505] [2024-11-10 05:30:16,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532196505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:16,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:16,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:30:16,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072463666] [2024-11-10 05:30:16,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:16,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:30:16,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:16,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:30:16,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:30:16,307 INFO L87 Difference]: Start difference. First operand 2009 states and 2787 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:16,891 INFO L93 Difference]: Finished difference Result 4457 states and 6196 transitions. [2024-11-10 05:30:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:30:16,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 165 [2024-11-10 05:30:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:16,900 INFO L225 Difference]: With dead ends: 4457 [2024-11-10 05:30:16,900 INFO L226 Difference]: Without dead ends: 2497 [2024-11-10 05:30:16,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:30:16,905 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 97 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:16,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 827 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:30:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2024-11-10 05:30:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2084. [2024-11-10 05:30:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1874 states have (on average 1.3303094983991461) internal successors, (2493), 1881 states have internal predecessors, (2493), 192 states have call successors, (192), 17 states have call predecessors, (192), 17 states have return successors, (192), 185 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-10 05:30:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2877 transitions. [2024-11-10 05:30:17,117 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2877 transitions. Word has length 165 [2024-11-10 05:30:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:17,117 INFO L471 AbstractCegarLoop]: Abstraction has 2084 states and 2877 transitions. [2024-11-10 05:30:17,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2877 transitions. [2024-11-10 05:30:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 05:30:17,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:17,119 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:17,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 05:30:17,119 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:17,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1435097401, now seen corresponding path program 1 times [2024-11-10 05:30:17,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:17,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004113149] [2024-11-10 05:30:17,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:17,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:17,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:17,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004113149] [2024-11-10 05:30:17,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004113149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:17,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:17,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:30:17,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112937757] [2024-11-10 05:30:17,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:17,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:30:17,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:17,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:30:17,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:30:17,546 INFO L87 Difference]: Start difference. First operand 2084 states and 2877 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:17,890 INFO L93 Difference]: Finished difference Result 2942 states and 4068 transitions. [2024-11-10 05:30:17,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:30:17,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 165 [2024-11-10 05:30:17,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:17,896 INFO L225 Difference]: With dead ends: 2942 [2024-11-10 05:30:17,897 INFO L226 Difference]: Without dead ends: 2061 [2024-11-10 05:30:17,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:30:17,899 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 95 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:17,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 373 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:30:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2024-11-10 05:30:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 2054. [2024-11-10 05:30:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 1844 states have (on average 1.3286334056399132) internal successors, (2450), 1851 states have internal predecessors, (2450), 192 states have call successors, (192), 17 states have call predecessors, (192), 17 states have return successors, (192), 185 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-10 05:30:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2834 transitions. [2024-11-10 05:30:18,096 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2834 transitions. Word has length 165 [2024-11-10 05:30:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:18,096 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 2834 transitions. [2024-11-10 05:30:18,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2834 transitions. [2024-11-10 05:30:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 05:30:18,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:18,098 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:18,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 05:30:18,098 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:18,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:18,098 INFO L85 PathProgramCache]: Analyzing trace with hash -434816922, now seen corresponding path program 1 times [2024-11-10 05:30:18,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:18,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300378509] [2024-11-10 05:30:18,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:18,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:30:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:30:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:30:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:30:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:30:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:30:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:30:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:30:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:30:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:30:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:30:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:30:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:30:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 05:30:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:30:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 05:30:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:30:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 05:30:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:30:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 05:30:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:30:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 05:30:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:18,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:30:18,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300378509] [2024-11-10 05:30:18,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300378509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:18,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:18,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:30:18,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187009879] [2024-11-10 05:30:18,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:18,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:30:18,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:30:18,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:30:18,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:30:18,314 INFO L87 Difference]: Start difference. First operand 2054 states and 2834 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:18,774 INFO L93 Difference]: Finished difference Result 3757 states and 5148 transitions. [2024-11-10 05:30:18,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:30:18,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 165 [2024-11-10 05:30:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:18,780 INFO L225 Difference]: With dead ends: 3757 [2024-11-10 05:30:18,781 INFO L226 Difference]: Without dead ends: 2304 [2024-11-10 05:30:18,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:30:18,783 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 138 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:18,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 467 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:30:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2024-11-10 05:30:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2056. [2024-11-10 05:30:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 1846 states have (on average 1.3282773564463706) internal successors, (2452), 1852 states have internal predecessors, (2452), 192 states have call successors, (192), 17 states have call predecessors, (192), 17 states have return successors, (192), 186 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-10 05:30:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2836 transitions. [2024-11-10 05:30:18,984 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2836 transitions. Word has length 165 [2024-11-10 05:30:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:18,984 INFO L471 AbstractCegarLoop]: Abstraction has 2056 states and 2836 transitions. [2024-11-10 05:30:18,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2836 transitions. [2024-11-10 05:30:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 05:30:18,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:18,986 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:18,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 05:30:18,986 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:18,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1769271016, now seen corresponding path program 1 times [2024-11-10 05:30:18,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:30:18,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384066334] [2024-11-10 05:30:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:18,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:30:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:30:19,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:30:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:30:19,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:30:19,115 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:30:19,116 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:30:19,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 05:30:19,124 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:19,232 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:30:19,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:30:19 BoogieIcfgContainer [2024-11-10 05:30:19,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:30:19,235 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:30:19,235 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:30:19,236 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:30:19,236 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:29:46" (3/4) ... [2024-11-10 05:30:19,238 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:30:19,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:30:19,239 INFO L158 Benchmark]: Toolchain (without parser) took 33749.44ms. Allocated memory was 146.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 76.1MB in the beginning and 751.7MB in the end (delta: -675.6MB). Peak memory consumption was 494.6MB. Max. memory is 16.1GB. [2024-11-10 05:30:19,239 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:30:19,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.63ms. Allocated memory is still 146.8MB. Free memory was 75.7MB in the beginning and 58.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 05:30:19,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.22ms. Allocated memory is still 146.8MB. Free memory was 58.0MB in the beginning and 53.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:30:19,240 INFO L158 Benchmark]: Boogie Preprocessor took 104.09ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 53.0MB in the beginning and 181.6MB in the end (delta: -128.6MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-11-10 05:30:19,240 INFO L158 Benchmark]: IcfgBuilder took 679.21ms. Allocated memory is still 213.9MB. Free memory was 181.6MB in the beginning and 150.4MB in the end (delta: 31.2MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-11-10 05:30:19,240 INFO L158 Benchmark]: TraceAbstraction took 32566.08ms. Allocated memory was 213.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 150.4MB in the beginning and 751.7MB in the end (delta: -601.3MB). Peak memory consumption was 500.7MB. Max. memory is 16.1GB. [2024-11-10 05:30:19,240 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 1.3GB. Free memory is still 751.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:30:19,241 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.16ms. Allocated memory is still 146.8MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.63ms. Allocated memory is still 146.8MB. Free memory was 75.7MB in the beginning and 58.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.22ms. Allocated memory is still 146.8MB. Free memory was 58.0MB in the beginning and 53.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.09ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 53.0MB in the beginning and 181.6MB in the end (delta: -128.6MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * IcfgBuilder took 679.21ms. Allocated memory is still 213.9MB. Free memory was 181.6MB in the beginning and 150.4MB in the end (delta: 31.2MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * TraceAbstraction took 32566.08ms. Allocated memory was 213.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 150.4MB in the beginning and 751.7MB in the end (delta: -601.3MB). Peak memory consumption was 500.7MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 1.3GB. Free memory is still 751.7MB. 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 182, overapproximation of someBinaryFLOATComparisonOperation at line 182. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] double var_1_40 = 8.35; [L45] unsigned short int var_1_45 = 50; [L46] unsigned char var_1_46 = 0; [L47] unsigned char var_1_47 = 5; [L48] unsigned char var_1_48 = 1; [L49] signed char var_1_49 = -16; [L50] signed char var_1_50 = 2; [L51] signed char var_1_51 = 16; [L52] signed long int var_1_53 = 256; [L53] double var_1_54 = 1.25; [L54] unsigned long int var_1_55 = 5; [L55] signed long int last_1_var_1_1 = 64; [L56] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L178] last_1_var_1_1 = var_1_1 [L179] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L140] var_1_7 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L141] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L142] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L142] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L143] var_1_15 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L144] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L147] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L149] var_1_18 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L150] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L151] var_1_19 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] var_1_20 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] var_1_21 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] var_1_23 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] var_1_27 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_28 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] var_1_47 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] var_1_50 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] var_1_51 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] RET updateVariables() [L191] CALL step() [L60] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L61] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L64] var_1_31 = var_1_13 [L65] var_1_55 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L66] COND FALSE !(\read(var_1_7)) [L69] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L71] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L74] COND FALSE !(var_1_21 > (var_1_21 + var_1_23)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L81] var_1_48 = var_1_15 [L82] var_1_32 = var_1_16 [L83] var_1_54 = var_1_18 [L84] var_1_30 = var_1_32 [L85] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=506, var_1_55=64, var_1_7=0] [L86] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=506, var_1_55=64, var_1_7=0] [L86] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L87] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=506, var_1_55=64, var_1_7=0] [L89] COND TRUE (-32 & var_1_15) > var_1_11 [L90] var_1_40 = ((((var_1_21) > (var_1_19)) ? (var_1_21) : (var_1_19))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=64, var_1_21=505, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=506, var_1_55=64, var_1_7=0] [L94] COND TRUE var_1_19 >= ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=64, var_1_21=505, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=506, var_1_55=64, var_1_7=0] [L95] COND FALSE !(var_1_30 > var_1_16) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=64, var_1_21=505, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=506, var_1_55=64, var_1_7=0] [L105] COND TRUE var_1_21 < var_1_22 [L106] var_1_49 = ((var_1_50 - var_1_51) + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=64, var_1_21=505, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=506, var_1_55=64, var_1_7=0] [L110] COND TRUE var_1_11 >= var_1_30 [L111] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=64, var_1_21=505, var_1_22=507, var_1_24=10, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=256, var_1_54=506, var_1_55=64, var_1_7=0] [L113] var_1_53 = var_1_1 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=64, var_1_21=505, var_1_22=507, var_1_24=10, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L114] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=64, var_1_21=505, var_1_22=507, var_1_24=10, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L114] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L115] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=8, var_1_21=505, var_1_22=507, var_1_24=10, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L123] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=8, var_1_21=505, var_1_22=507, var_1_24=10, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L124] COND TRUE ! var_1_7 [L125] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=8, var_1_21=505, var_1_22=507, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L133] EXPR var_1_30 ^ var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=8, var_1_21=505, var_1_22=507, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L133] EXPR var_1_13 | var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=8, var_1_21=505, var_1_22=507, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L133] COND TRUE (var_1_30 ^ var_1_32) < (var_1_13 | var_1_11) [L134] var_1_33 = ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=8, var_1_21=505, var_1_22=507, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L191] RET step() [L192] CALL, EXPR property() [L182] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=8, var_1_21=505, var_1_22=507, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L182] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=8, var_1_21=505, var_1_22=507, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L182] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=8, var_1_21=505, var_1_22=507, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L182] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=8, var_1_21=505, var_1_22=507, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L182-L183] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=8, var_1_21=505, var_1_22=507, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=320, var_1_16=0, var_1_17=507, var_1_18=506, var_1_19=505, var_1_1=8, var_1_21=505, var_1_22=507, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=64, var_1_40=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=320, var_1_49=-122, var_1_50=0, var_1_51=63, var_1_53=64, var_1_54=506, var_1_55=64, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.4s, OverallIterations: 31, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8076 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8076 mSDsluCounter, 20992 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15033 mSDsCounter, 1021 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12190 IncrementalHoareTripleChecker+Invalid, 13211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1021 mSolverCounterUnsat, 5959 mSDtfsCounter, 12190 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1696 GetRequests, 1482 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2084occurred in iteration=28, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 8545 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 5056 NumberOfCodeBlocks, 5056 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4861 ConstructedInterpolants, 0 QuantifiedInterpolants, 19350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 27720/27720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 05:30:19,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.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 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:30:21,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:30:21,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:30:21,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:30:21,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:30:21,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:30:21,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:30:21,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:30:21,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:30:21,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:30:21,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:30:21,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:30:21,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:30:21,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:30:21,573 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:30:21,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:30:21,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:30:21,575 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:30:21,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:30:21,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:30:21,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:30:21,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:30:21,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:30:21,579 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:30:21,579 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:30:21,579 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:30:21,580 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:30:21,580 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:30:21,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:30:21,580 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:30:21,580 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:30:21,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:30:21,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:30:21,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:30:21,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:30:21,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:30:21,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:30:21,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:30:21,581 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:30:21,581 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:30:21,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:30:21,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:30:21,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:30:21,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:30:21,584 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 -> 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 [2024-11-10 05:30:21,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:30:21,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:30:21,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:30:21,900 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:30:21,900 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:30:21,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2024-11-10 05:30:23,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:30:23,672 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:30:23,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2024-11-10 05:30:23,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15700dbf/5f501afd674e4c4da104b4c4de8013c7/FLAGf2e9df3c3 [2024-11-10 05:30:24,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15700dbf/5f501afd674e4c4da104b4c4de8013c7 [2024-11-10 05:30:24,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:30:24,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:30:24,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:30:24,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:30:24,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:30:24,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70373e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24, skipping insertion in model container [2024-11-10 05:30:24,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:30:24,234 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i[919,932] [2024-11-10 05:30:24,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:30:24,328 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:30:24,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i[919,932] [2024-11-10 05:30:24,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:30:24,409 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:30:24,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24 WrapperNode [2024-11-10 05:30:24,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:30:24,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:30:24,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:30:24,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:30:24,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,464 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-10 05:30:24,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:30:24,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:30:24,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:30:24,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:30:24,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,495 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:30:24,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:30:24,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:30:24,528 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:30:24,528 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:30:24,529 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (1/1) ... [2024-11-10 05:30:24,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:30:24,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:30:24,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 05:30:24,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 05:30:24,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:30:24,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:30:24,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:30:24,606 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:30:24,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:30:24,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:30:24,701 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:30:24,704 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:30:30,890 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 05:30:30,891 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:30:30,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:30:30,902 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:30:30,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:30:30 BoogieIcfgContainer [2024-11-10 05:30:30,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:30:30,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:30:30,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:30:30,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:30:30,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:30:24" (1/3) ... [2024-11-10 05:30:30,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db6f10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:30:30, skipping insertion in model container [2024-11-10 05:30:30,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:24" (2/3) ... [2024-11-10 05:30:30,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db6f10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:30:30, skipping insertion in model container [2024-11-10 05:30:30,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:30:30" (3/3) ... [2024-11-10 05:30:30,910 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2024-11-10 05:30:30,924 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:30:30,924 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:30:30,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:30:30,984 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;@172bc226, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:30:30,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:30:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:30:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 05:30:31,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:31,003 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:31,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:31,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:31,009 INFO L85 PathProgramCache]: Analyzing trace with hash 449869647, now seen corresponding path program 1 times [2024-11-10 05:30:31,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:30:31,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359284586] [2024-11-10 05:30:31,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:31,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:30:31,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:30:31,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:30:31,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 05:30:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:31,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 05:30:31,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:30:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-10 05:30:31,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:30:31,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:30:31,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359284586] [2024-11-10 05:30:31,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359284586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:31,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:31,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:30:31,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093944948] [2024-11-10 05:30:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:31,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:30:31,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:30:31,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:30:31,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:30:31,744 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 05:30:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:31,771 INFO L93 Difference]: Finished difference Result 152 states and 259 transitions. [2024-11-10 05:30:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:30:31,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 152 [2024-11-10 05:30:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:31,779 INFO L225 Difference]: With dead ends: 152 [2024-11-10 05:30:31,779 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 05:30:31,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:30:31,785 INFO L432 NwaCegarLoop]: 114 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, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:31,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:30:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 05:30:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-10 05:30:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:30:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 114 transitions. [2024-11-10 05:30:31,828 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 114 transitions. Word has length 152 [2024-11-10 05:30:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:31,829 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 114 transitions. [2024-11-10 05:30:31,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 05:30:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 114 transitions. [2024-11-10 05:30:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 05:30:31,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:31,833 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:31,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 05:30:32,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:30:32,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:32,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1830390763, now seen corresponding path program 1 times [2024-11-10 05:30:32,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:30:32,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790624226] [2024-11-10 05:30:32,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:32,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:30:32,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:30:32,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:30:32,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 05:30:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:32,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 05:30:32,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:30:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:34,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:30:34,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:30:34,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790624226] [2024-11-10 05:30:34,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790624226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:34,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:34,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:30:34,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557475008] [2024-11-10 05:30:34,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:34,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:30:34,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:30:34,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:30:34,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:30:34,659 INFO L87 Difference]: Start difference. First operand 75 states and 114 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:39,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:30:41,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:30:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:41,969 INFO L93 Difference]: Finished difference Result 221 states and 338 transitions. [2024-11-10 05:30:41,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:30:41,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-11-10 05:30:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:41,997 INFO L225 Difference]: With dead ends: 221 [2024-11-10 05:30:41,997 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 05:30:41,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:30:41,999 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 99 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:41,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 371 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-10 05:30:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 05:30:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 119. [2024-11-10 05:30:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 05:30:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 179 transitions. [2024-11-10 05:30:42,052 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 179 transitions. Word has length 152 [2024-11-10 05:30:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:42,053 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 179 transitions. [2024-11-10 05:30:42,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 179 transitions. [2024-11-10 05:30:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 05:30:42,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:42,055 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:42,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 05:30:42,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:30:42,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:42,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:42,257 INFO L85 PathProgramCache]: Analyzing trace with hash 426520244, now seen corresponding path program 1 times [2024-11-10 05:30:42,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:30:42,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542974618] [2024-11-10 05:30:42,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:42,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:30:42,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:30:42,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:30:42,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 05:30:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:42,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 05:30:42,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:30:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:30:42,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:30:42,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:30:42,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542974618] [2024-11-10 05:30:42,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542974618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:30:42,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:30:42,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:30:42,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692638663] [2024-11-10 05:30:42,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:30:42,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:30:42,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:30:42,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:30:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:30:42,688 INFO L87 Difference]: Start difference. First operand 119 states and 179 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:46,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:30:50,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:30:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:30:50,938 INFO L93 Difference]: Finished difference Result 219 states and 333 transitions. [2024-11-10 05:30:50,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:30:50,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-11-10 05:30:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:30:50,941 INFO L225 Difference]: With dead ends: 219 [2024-11-10 05:30:50,941 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 05:30:50,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:30:50,942 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 41 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:30:50,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 221 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2024-11-10 05:30:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 05:30:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2024-11-10 05:30:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 05:30:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2024-11-10 05:30:50,959 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 207 transitions. Word has length 152 [2024-11-10 05:30:50,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:30:50,959 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 207 transitions. [2024-11-10 05:30:50,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:30:50,960 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 207 transitions. [2024-11-10 05:30:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 05:30:50,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:30:50,962 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:30:50,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 05:30:51,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:30:51,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:30:51,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:30:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash 17696019, now seen corresponding path program 1 times [2024-11-10 05:30:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:30:51,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042928209] [2024-11-10 05:30:51,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:30:51,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:30:51,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:30:51,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:30:51,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 05:30:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:30:51,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 05:30:51,563 INFO L278 TraceCheckSpWp]: Computing forward predicates...