./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -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 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:19:09,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:19:09,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:19:09,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:19:09,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:19:09,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:19:09,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:19:09,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:19:09,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:19:09,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:19:09,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:19:09,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:19:09,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:19:09,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:19:09,251 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:19:09,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:19:09,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:19:09,252 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:19:09,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:19:09,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:19:09,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:19:09,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:19:09,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:19:09,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:19:09,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:19:09,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:19:09,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:19:09,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:19:09,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:19:09,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:19:09,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:19:09,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:19:09,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:19:09,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:19:09,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:19:09,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:19:09,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:19:09,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:19:09,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:19:09,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:19:09,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:19:09,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:19:09,268 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 -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2024-10-24 01:19:09,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:19:09,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:19:09,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:19:09,588 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:19:09,588 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:19:09,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-10-24 01:19:11,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:19:11,331 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:19:11,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-10-24 01:19:11,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994680dfc/d97213101aa74e8fa47162e2e1dbc8c0/FLAGaab54c8fe [2024-10-24 01:19:11,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994680dfc/d97213101aa74e8fa47162e2e1dbc8c0 [2024-10-24 01:19:11,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:19:11,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:19:11,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:19:11,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:19:11,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:19:11,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:11,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4e84fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11, skipping insertion in model container [2024-10-24 01:19:11,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:11,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:19:11,707 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2024-10-24 01:19:11,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:19:11,733 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:19:11,805 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2024-10-24 01:19:11,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:19:11,830 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:19:11,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11 WrapperNode [2024-10-24 01:19:11,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:19:11,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:19:11,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:19:11,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:19:11,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:11,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:11,934 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 419 [2024-10-24 01:19:11,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:19:11,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:19:11,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:19:11,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:19:11,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:11,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:11,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:12,016 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-10-24 01:19:12,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:12,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:12,035 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:12,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:12,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:12,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:12,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:19:12,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:19:12,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:19:12,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:19:12,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (1/1) ... [2024-10-24 01:19:12,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:19:12,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:12,101 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-10-24 01:19:12,110 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-10-24 01:19:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:19:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-10-24 01:19:12,163 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-10-24 01:19:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-24 01:19:12,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-24 01:19:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-10-24 01:19:12,164 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-10-24 01:19:12,166 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-10-24 01:19:12,166 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-10-24 01:19:12,166 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-10-24 01:19:12,167 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-10-24 01:19:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 01:19:12,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 01:19:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:19:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:19:12,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:19:12,299 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:19:12,304 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:19:12,881 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-10-24 01:19:12,882 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:19:12,923 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:19:12,924 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 01:19:12,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:19:12 BoogieIcfgContainer [2024-10-24 01:19:12,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:19:12,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:19:12,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:19:12,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:19:12,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:19:11" (1/3) ... [2024-10-24 01:19:12,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cb1e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:19:12, skipping insertion in model container [2024-10-24 01:19:12,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:11" (2/3) ... [2024-10-24 01:19:12,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cb1e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:19:12, skipping insertion in model container [2024-10-24 01:19:12,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:19:12" (3/3) ... [2024-10-24 01:19:12,935 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-10-24 01:19:12,955 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:19:12,955 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:19:13,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:19:13,044 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;@7254862c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:19:13,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:19:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 134 states have internal predecessors, (207), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-24 01:19:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 01:19:13,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:13,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:13,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:13,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:13,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1165195423, now seen corresponding path program 1 times [2024-10-24 01:19:13,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:13,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866960789] [2024-10-24 01:19:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:13,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:13,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:13,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866960789] [2024-10-24 01:19:13,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866960789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:13,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:13,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:13,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031982218] [2024-10-24 01:19:13,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:13,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:13,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:13,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:13,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:13,561 INFO L87 Difference]: Start difference. First operand has 174 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 134 states have internal predecessors, (207), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:13,715 INFO L93 Difference]: Finished difference Result 350 states and 603 transitions. [2024-10-24 01:19:13,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 01:19:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:13,735 INFO L225 Difference]: With dead ends: 350 [2024-10-24 01:19:13,735 INFO L226 Difference]: Without dead ends: 178 [2024-10-24 01:19:13,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:13,745 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 7 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:13,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 791 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:13,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-24 01:19:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-10-24 01:19:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 133 states have (on average 1.5639097744360901) internal successors, (208), 137 states have internal predecessors, (208), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-24 01:19:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 282 transitions. [2024-10-24 01:19:13,809 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 282 transitions. Word has length 14 [2024-10-24 01:19:13,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:13,809 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 282 transitions. [2024-10-24 01:19:13,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 282 transitions. [2024-10-24 01:19:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 01:19:13,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:13,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:13,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:19:13,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:13,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 579778909, now seen corresponding path program 1 times [2024-10-24 01:19:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129609800] [2024-10-24 01:19:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:13,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:13,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129609800] [2024-10-24 01:19:13,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129609800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:13,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:13,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:13,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033422578] [2024-10-24 01:19:13,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:13,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:13,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:13,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:13,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:13,974 INFO L87 Difference]: Start difference. First operand 178 states and 282 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:14,073 INFO L93 Difference]: Finished difference Result 370 states and 588 transitions. [2024-10-24 01:19:14,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:14,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-24 01:19:14,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:14,077 INFO L225 Difference]: With dead ends: 370 [2024-10-24 01:19:14,077 INFO L226 Difference]: Without dead ends: 194 [2024-10-24 01:19:14,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:14,080 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 25 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:14,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 807 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-24 01:19:14,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2024-10-24 01:19:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 144 states have (on average 1.5416666666666667) internal successors, (222), 148 states have internal predecessors, (222), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 01:19:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 298 transitions. [2024-10-24 01:19:14,104 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 298 transitions. Word has length 15 [2024-10-24 01:19:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:14,104 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 298 transitions. [2024-10-24 01:19:14,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 298 transitions. [2024-10-24 01:19:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 01:19:14,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:14,106 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:14,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:19:14,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:14,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1957244647, now seen corresponding path program 1 times [2024-10-24 01:19:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:14,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436245612] [2024-10-24 01:19:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:14,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:14,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:14,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436245612] [2024-10-24 01:19:14,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436245612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:14,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:14,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:14,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592747200] [2024-10-24 01:19:14,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:14,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:14,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:14,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:14,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:14,228 INFO L87 Difference]: Start difference. First operand 191 states and 298 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:19:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:14,272 INFO L93 Difference]: Finished difference Result 402 states and 634 transitions. [2024-10-24 01:19:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:14,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-24 01:19:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:14,278 INFO L225 Difference]: With dead ends: 402 [2024-10-24 01:19:14,278 INFO L226 Difference]: Without dead ends: 220 [2024-10-24 01:19:14,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-24 01:19:14,283 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 22 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:14,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 542 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-24 01:19:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 193. [2024-10-24 01:19:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 150 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 01:19:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2024-10-24 01:19:14,317 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 23 [2024-10-24 01:19:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:14,318 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2024-10-24 01:19:14,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:19:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2024-10-24 01:19:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 01:19:14,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:14,320 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 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-10-24 01:19:14,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:19:14,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:14,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:14,321 INFO L85 PathProgramCache]: Analyzing trace with hash 784621896, now seen corresponding path program 1 times [2024-10-24 01:19:14,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:14,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558871536] [2024-10-24 01:19:14,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:14,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:14,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558871536] [2024-10-24 01:19:14,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558871536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:14,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:14,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:19:14,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074817795] [2024-10-24 01:19:14,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:14,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:14,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:14,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:14,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:14,531 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 01:19:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:14,592 INFO L93 Difference]: Finished difference Result 377 states and 590 transitions. [2024-10-24 01:19:14,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:14,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-24 01:19:14,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:14,596 INFO L225 Difference]: With dead ends: 377 [2024-10-24 01:19:14,596 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 01:19:14,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:14,599 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:14,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1080 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 01:19:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2024-10-24 01:19:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 149 states have (on average 1.523489932885906) internal successors, (227), 153 states have internal predecessors, (227), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2024-10-24 01:19:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 304 transitions. [2024-10-24 01:19:14,622 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 304 transitions. Word has length 31 [2024-10-24 01:19:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:14,623 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 304 transitions. [2024-10-24 01:19:14,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 01:19:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 304 transitions. [2024-10-24 01:19:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:19:14,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:14,625 INFO L215 NwaCegarLoop]: trace 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, 1, 1, 1] [2024-10-24 01:19:14,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:19:14,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:14,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:14,626 INFO L85 PathProgramCache]: Analyzing trace with hash -64301629, now seen corresponding path program 1 times [2024-10-24 01:19:14,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:14,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618320638] [2024-10-24 01:19:14,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:14,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:19:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:14,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:14,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618320638] [2024-10-24 01:19:14,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618320638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:14,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:14,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:19:14,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439738655] [2024-10-24 01:19:14,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:14,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:19:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:14,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:19:14,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:19:14,796 INFO L87 Difference]: Start difference. First operand 197 states and 304 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 01:19:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:14,888 INFO L93 Difference]: Finished difference Result 340 states and 531 transitions. [2024-10-24 01:19:14,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:19:14,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-10-24 01:19:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:14,891 INFO L225 Difference]: With dead ends: 340 [2024-10-24 01:19:14,891 INFO L226 Difference]: Without dead ends: 193 [2024-10-24 01:19:14,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:19:14,896 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:14,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1312 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-24 01:19:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-10-24 01:19:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5) internal successors, (219), 150 states have internal predecessors, (219), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 01:19:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 295 transitions. [2024-10-24 01:19:14,918 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 295 transitions. Word has length 34 [2024-10-24 01:19:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:14,920 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 295 transitions. [2024-10-24 01:19:14,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 01:19:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 295 transitions. [2024-10-24 01:19:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:19:14,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:14,922 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:14,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:19:14,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:14,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash 972312280, now seen corresponding path program 1 times [2024-10-24 01:19:14,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:14,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880778241] [2024-10-24 01:19:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:14,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:15,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:15,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880778241] [2024-10-24 01:19:15,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880778241] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:15,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647855917] [2024-10-24 01:19:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:15,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:15,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:15,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:19:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 01:19:15,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:15,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:15,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647855917] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:15,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:15,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-10-24 01:19:15,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977505391] [2024-10-24 01:19:15,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:15,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:15,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:15,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:15,273 INFO L87 Difference]: Start difference. First operand 193 states and 295 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:19:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:15,342 INFO L93 Difference]: Finished difference Result 435 states and 678 transitions. [2024-10-24 01:19:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:15,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2024-10-24 01:19:15,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:15,346 INFO L225 Difference]: With dead ends: 435 [2024-10-24 01:19:15,347 INFO L226 Difference]: Without dead ends: 252 [2024-10-24 01:19:15,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:15,350 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 75 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:15,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 794 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-24 01:19:15,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2024-10-24 01:19:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 189 states have (on average 1.470899470899471) internal successors, (278), 193 states have internal predecessors, (278), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 01:19:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 374 transitions. [2024-10-24 01:19:15,373 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 374 transitions. Word has length 34 [2024-10-24 01:19:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:15,373 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 374 transitions. [2024-10-24 01:19:15,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:19:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 374 transitions. [2024-10-24 01:19:15,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 01:19:15,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:15,378 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:15,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:19:15,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 01:19:15,579 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:15,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:15,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1882466360, now seen corresponding path program 2 times [2024-10-24 01:19:15,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:15,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331044025] [2024-10-24 01:19:15,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:15,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-24 01:19:15,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:15,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331044025] [2024-10-24 01:19:15,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331044025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:15,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:15,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:15,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197605846] [2024-10-24 01:19:15,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:15,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:15,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:15,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:15,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:15,703 INFO L87 Difference]: Start difference. First operand 246 states and 374 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 01:19:15,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:15,761 INFO L93 Difference]: Finished difference Result 503 states and 775 transitions. [2024-10-24 01:19:15,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:15,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2024-10-24 01:19:15,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:15,765 INFO L225 Difference]: With dead ends: 503 [2024-10-24 01:19:15,765 INFO L226 Difference]: Without dead ends: 285 [2024-10-24 01:19:15,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-10-24 01:19:15,767 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 24 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:15,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 799 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-24 01:19:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2024-10-24 01:19:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 221 states have (on average 1.4253393665158371) internal successors, (315), 225 states have internal predecessors, (315), 51 states have call successors, (51), 9 states have call predecessors, (51), 9 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 01:19:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 417 transitions. [2024-10-24 01:19:15,783 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 417 transitions. Word has length 56 [2024-10-24 01:19:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:15,783 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 417 transitions. [2024-10-24 01:19:15,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 01:19:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 417 transitions. [2024-10-24 01:19:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 01:19:15,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:15,785 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:15,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:19:15,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:15,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash 431791273, now seen corresponding path program 1 times [2024-10-24 01:19:15,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:15,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662789788] [2024-10-24 01:19:15,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:15,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-24 01:19:15,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:15,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662789788] [2024-10-24 01:19:15,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662789788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:15,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:15,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64021207] [2024-10-24 01:19:15,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:15,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:15,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:15,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:15,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:15,883 INFO L87 Difference]: Start difference. First operand 282 states and 417 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 01:19:15,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:15,945 INFO L93 Difference]: Finished difference Result 538 states and 816 transitions. [2024-10-24 01:19:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:15,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2024-10-24 01:19:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:15,950 INFO L225 Difference]: With dead ends: 538 [2024-10-24 01:19:15,950 INFO L226 Difference]: Without dead ends: 289 [2024-10-24 01:19:15,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-10-24 01:19:15,953 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 8 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:15,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 781 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-24 01:19:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-10-24 01:19:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.422907488986784) internal successors, (323), 231 states have internal predecessors, (323), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 01:19:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 425 transitions. [2024-10-24 01:19:15,976 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 425 transitions. Word has length 56 [2024-10-24 01:19:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:15,976 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 425 transitions. [2024-10-24 01:19:15,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 01:19:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 425 transitions. [2024-10-24 01:19:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:19:15,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:15,978 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:15,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:19:15,978 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:15,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:15,979 INFO L85 PathProgramCache]: Analyzing trace with hash -349947768, now seen corresponding path program 1 times [2024-10-24 01:19:15,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:15,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691963101] [2024-10-24 01:19:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:15,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 01:19:16,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:16,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691963101] [2024-10-24 01:19:16,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691963101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:16,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:16,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:19:16,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576999105] [2024-10-24 01:19:16,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:16,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:16,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:16,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:16,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:16,121 INFO L87 Difference]: Start difference. First operand 289 states and 425 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:19:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:16,168 INFO L93 Difference]: Finished difference Result 528 states and 790 transitions. [2024-10-24 01:19:16,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:16,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2024-10-24 01:19:16,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:16,174 INFO L225 Difference]: With dead ends: 528 [2024-10-24 01:19:16,174 INFO L226 Difference]: Without dead ends: 291 [2024-10-24 01:19:16,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:16,177 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:16,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1067 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-24 01:19:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2024-10-24 01:19:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.4096916299559472) internal successors, (320), 231 states have internal predecessors, (320), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 01:19:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 422 transitions. [2024-10-24 01:19:16,196 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 422 transitions. Word has length 74 [2024-10-24 01:19:16,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:16,196 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 422 transitions. [2024-10-24 01:19:16,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:19:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 422 transitions. [2024-10-24 01:19:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:19:16,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:16,199 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:16,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:19:16,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:16,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:16,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1852005032, now seen corresponding path program 1 times [2024-10-24 01:19:16,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:16,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505652486] [2024-10-24 01:19:16,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:16,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-24 01:19:16,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:16,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505652486] [2024-10-24 01:19:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505652486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:16,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:16,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:16,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344689641] [2024-10-24 01:19:16,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:16,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:16,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:16,381 INFO L87 Difference]: Start difference. First operand 289 states and 422 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:19:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:16,447 INFO L93 Difference]: Finished difference Result 565 states and 846 transitions. [2024-10-24 01:19:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:16,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2024-10-24 01:19:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:16,452 INFO L225 Difference]: With dead ends: 565 [2024-10-24 01:19:16,453 INFO L226 Difference]: Without dead ends: 333 [2024-10-24 01:19:16,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-10-24 01:19:16,455 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 25 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:16,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 799 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-24 01:19:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2024-10-24 01:19:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 264 states have (on average 1.371212121212121) internal successors, (362), 268 states have internal predecessors, (362), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 01:19:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 470 transitions. [2024-10-24 01:19:16,476 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 470 transitions. Word has length 103 [2024-10-24 01:19:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:16,476 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 470 transitions. [2024-10-24 01:19:16,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:19:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 470 transitions. [2024-10-24 01:19:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 01:19:16,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:16,480 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:16,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:19:16,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:16,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:16,482 INFO L85 PathProgramCache]: Analyzing trace with hash 497991807, now seen corresponding path program 1 times [2024-10-24 01:19:16,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:16,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045534836] [2024-10-24 01:19:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:16,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-10-24 01:19:16,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:16,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045534836] [2024-10-24 01:19:16,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045534836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:16,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:16,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734769939] [2024-10-24 01:19:16,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:16,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:16,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:16,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:16,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:16,603 INFO L87 Difference]: Start difference. First operand 330 states and 470 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:19:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:16,665 INFO L93 Difference]: Finished difference Result 591 states and 866 transitions. [2024-10-24 01:19:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:16,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-10-24 01:19:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:16,669 INFO L225 Difference]: With dead ends: 591 [2024-10-24 01:19:16,669 INFO L226 Difference]: Without dead ends: 324 [2024-10-24 01:19:16,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-10-24 01:19:16,672 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 9 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:16,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 764 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-24 01:19:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-10-24 01:19:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 259 states have (on average 1.3513513513513513) internal successors, (350), 263 states have internal predecessors, (350), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-24 01:19:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 456 transitions. [2024-10-24 01:19:16,691 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 456 transitions. Word has length 104 [2024-10-24 01:19:16,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:16,692 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 456 transitions. [2024-10-24 01:19:16,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:19:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 456 transitions. [2024-10-24 01:19:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 01:19:16,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:16,694 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:16,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:19:16,695 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:16,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1261568454, now seen corresponding path program 1 times [2024-10-24 01:19:16,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:16,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037160694] [2024-10-24 01:19:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-10-24 01:19:16,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:16,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037160694] [2024-10-24 01:19:16,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037160694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:16,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:16,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:19:16,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959869081] [2024-10-24 01:19:16,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:16,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:16,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:16,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:16,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:16,853 INFO L87 Difference]: Start difference. First operand 324 states and 456 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 01:19:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:16,890 INFO L93 Difference]: Finished difference Result 566 states and 815 transitions. [2024-10-24 01:19:16,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:16,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 123 [2024-10-24 01:19:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:16,894 INFO L225 Difference]: With dead ends: 566 [2024-10-24 01:19:16,894 INFO L226 Difference]: Without dead ends: 326 [2024-10-24 01:19:16,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:16,895 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:16,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1051 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-24 01:19:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2024-10-24 01:19:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 259 states have (on average 1.3397683397683398) internal successors, (347), 263 states have internal predecessors, (347), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-24 01:19:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 453 transitions. [2024-10-24 01:19:16,912 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 453 transitions. Word has length 123 [2024-10-24 01:19:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:16,912 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 453 transitions. [2024-10-24 01:19:16,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 01:19:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 453 transitions. [2024-10-24 01:19:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 01:19:16,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:16,914 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:16,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:19:16,914 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:16,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:16,916 INFO L85 PathProgramCache]: Analyzing trace with hash -25377946, now seen corresponding path program 1 times [2024-10-24 01:19:16,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:16,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579156915] [2024-10-24 01:19:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:16,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-10-24 01:19:17,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:17,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579156915] [2024-10-24 01:19:17,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579156915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:17,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:17,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896507374] [2024-10-24 01:19:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:17,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:17,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:17,056 INFO L87 Difference]: Start difference. First operand 324 states and 453 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 01:19:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:17,128 INFO L93 Difference]: Finished difference Result 529 states and 775 transitions. [2024-10-24 01:19:17,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:17,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 156 [2024-10-24 01:19:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:17,132 INFO L225 Difference]: With dead ends: 529 [2024-10-24 01:19:17,132 INFO L226 Difference]: Without dead ends: 322 [2024-10-24 01:19:17,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-10-24 01:19:17,133 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 7 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:17,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 732 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-24 01:19:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-10-24 01:19:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 258 states have (on average 1.3372093023255813) internal successors, (345), 262 states have internal predecessors, (345), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 01:19:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 449 transitions. [2024-10-24 01:19:17,149 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 449 transitions. Word has length 156 [2024-10-24 01:19:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:17,149 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 449 transitions. [2024-10-24 01:19:17,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 01:19:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 449 transitions. [2024-10-24 01:19:17,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 01:19:17,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:17,152 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:17,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:19:17,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:17,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash -93490958, now seen corresponding path program 1 times [2024-10-24 01:19:17,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:17,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858590579] [2024-10-24 01:19:17,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:17,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-24 01:19:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-10-24 01:19:17,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:17,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858590579] [2024-10-24 01:19:17,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858590579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:17,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:17,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51181078] [2024-10-24 01:19:17,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:17,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:17,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:17,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:17,350 INFO L87 Difference]: Start difference. First operand 322 states and 449 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 01:19:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:17,417 INFO L93 Difference]: Finished difference Result 469 states and 671 transitions. [2024-10-24 01:19:17,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:17,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 175 [2024-10-24 01:19:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:17,420 INFO L225 Difference]: With dead ends: 469 [2024-10-24 01:19:17,420 INFO L226 Difference]: Without dead ends: 305 [2024-10-24 01:19:17,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-10-24 01:19:17,421 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 35 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:17,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 708 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-24 01:19:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-10-24 01:19:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 244 states have (on average 1.3278688524590163) internal successors, (324), 248 states have internal predecessors, (324), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 01:19:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 422 transitions. [2024-10-24 01:19:17,436 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 422 transitions. Word has length 175 [2024-10-24 01:19:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:17,437 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 422 transitions. [2024-10-24 01:19:17,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 01:19:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 422 transitions. [2024-10-24 01:19:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 01:19:17,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:17,439 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:17,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:19:17,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:17,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:17,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1448764403, now seen corresponding path program 1 times [2024-10-24 01:19:17,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:17,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847205489] [2024-10-24 01:19:17,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:17,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 01:19:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-10-24 01:19:17,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:17,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847205489] [2024-10-24 01:19:17,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847205489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:17,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:17,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:17,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013969169] [2024-10-24 01:19:17,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:17,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:17,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:17,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:17,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:17,630 INFO L87 Difference]: Start difference. First operand 305 states and 422 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 01:19:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:17,696 INFO L93 Difference]: Finished difference Result 452 states and 644 transitions. [2024-10-24 01:19:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 177 [2024-10-24 01:19:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:17,700 INFO L225 Difference]: With dead ends: 452 [2024-10-24 01:19:17,700 INFO L226 Difference]: Without dead ends: 286 [2024-10-24 01:19:17,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-10-24 01:19:17,702 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 30 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:17,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 712 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-24 01:19:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-10-24 01:19:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 228 states have (on average 1.3201754385964912) internal successors, (301), 232 states have internal predecessors, (301), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 01:19:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 393 transitions. [2024-10-24 01:19:17,719 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 393 transitions. Word has length 177 [2024-10-24 01:19:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:17,719 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 393 transitions. [2024-10-24 01:19:17,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 01:19:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 393 transitions. [2024-10-24 01:19:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-24 01:19:17,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:17,722 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:17,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:19:17,722 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:17,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:17,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1265191700, now seen corresponding path program 1 times [2024-10-24 01:19:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18880157] [2024-10-24 01:19:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:17,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 01:19:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-10-24 01:19:17,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:17,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18880157] [2024-10-24 01:19:17,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18880157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:17,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:17,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:19:17,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115542091] [2024-10-24 01:19:17,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:17,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:17,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:17,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:17,917 INFO L87 Difference]: Start difference. First operand 286 states and 393 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 01:19:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:17,950 INFO L93 Difference]: Finished difference Result 432 states and 614 transitions. [2024-10-24 01:19:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:17,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 178 [2024-10-24 01:19:17,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:17,953 INFO L225 Difference]: With dead ends: 432 [2024-10-24 01:19:17,953 INFO L226 Difference]: Without dead ends: 286 [2024-10-24 01:19:17,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:17,954 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:17,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1029 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-24 01:19:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-10-24 01:19:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 228 states have (on average 1.293859649122807) internal successors, (295), 232 states have internal predecessors, (295), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 01:19:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 387 transitions. [2024-10-24 01:19:17,967 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 387 transitions. Word has length 178 [2024-10-24 01:19:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:17,967 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 387 transitions. [2024-10-24 01:19:17,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 01:19:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 387 transitions. [2024-10-24 01:19:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 01:19:17,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:17,970 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:17,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:19:17,970 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:17,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:17,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1759580199, now seen corresponding path program 1 times [2024-10-24 01:19:17,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:17,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340125447] [2024-10-24 01:19:17,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:17,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 01:19:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-24 01:19:18,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340125447] [2024-10-24 01:19:18,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340125447] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445498542] [2024-10-24 01:19:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:18,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:18,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:18,120 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:18,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 01:19:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 01:19:18,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-24 01:19:18,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-24 01:19:18,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445498542] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:18,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 01:19:18,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2024-10-24 01:19:18,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681972044] [2024-10-24 01:19:18,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:18,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:18,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:18,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:18,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:18,514 INFO L87 Difference]: Start difference. First operand 286 states and 387 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:19:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:18,567 INFO L93 Difference]: Finished difference Result 453 states and 636 transitions. [2024-10-24 01:19:18,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:18,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 185 [2024-10-24 01:19:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:18,570 INFO L225 Difference]: With dead ends: 453 [2024-10-24 01:19:18,570 INFO L226 Difference]: Without dead ends: 265 [2024-10-24 01:19:18,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 396 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-10-24 01:19:18,571 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 20 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:18,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 711 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-24 01:19:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-10-24 01:19:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 210 states have (on average 1.2857142857142858) internal successors, (270), 214 states have internal predecessors, (270), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 01:19:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 356 transitions. [2024-10-24 01:19:18,586 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 356 transitions. Word has length 185 [2024-10-24 01:19:18,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:18,587 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 356 transitions. [2024-10-24 01:19:18,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:19:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 356 transitions. [2024-10-24 01:19:18,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-24 01:19:18,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:18,591 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:18,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 01:19:18,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-24 01:19:18,793 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:18,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:18,793 INFO L85 PathProgramCache]: Analyzing trace with hash 238343948, now seen corresponding path program 1 times [2024-10-24 01:19:18,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:18,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351971693] [2024-10-24 01:19:18,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:18,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-10-24 01:19:18,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351971693] [2024-10-24 01:19:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351971693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:18,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:18,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234009836] [2024-10-24 01:19:18,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:18,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:18,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:18,994 INFO L87 Difference]: Start difference. First operand 265 states and 356 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 01:19:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:19,048 INFO L93 Difference]: Finished difference Result 408 states and 574 transitions. [2024-10-24 01:19:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:19,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 209 [2024-10-24 01:19:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:19,051 INFO L225 Difference]: With dead ends: 408 [2024-10-24 01:19:19,051 INFO L226 Difference]: Without dead ends: 269 [2024-10-24 01:19:19,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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-10-24 01:19:19,052 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 3 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:19,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 752 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-24 01:19:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-10-24 01:19:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 213 states have (on average 1.2816901408450705) internal successors, (273), 217 states have internal predecessors, (273), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 01:19:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 359 transitions. [2024-10-24 01:19:19,065 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 359 transitions. Word has length 209 [2024-10-24 01:19:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:19,065 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 359 transitions. [2024-10-24 01:19:19,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 01:19:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 359 transitions. [2024-10-24 01:19:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-24 01:19:19,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:19,070 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:19,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:19:19,070 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:19,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2053627783, now seen corresponding path program 1 times [2024-10-24 01:19:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:19,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254434397] [2024-10-24 01:19:19,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-10-24 01:19:19,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254434397] [2024-10-24 01:19:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254434397] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172725552] [2024-10-24 01:19:19,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:19,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:19,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:19,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:19,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 01:19:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 01:19:19,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-10-24 01:19:19,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:19:19,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172725552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:19,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:19:19,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-24 01:19:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648448260] [2024-10-24 01:19:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:19,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:19,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:19,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:19,508 INFO L87 Difference]: Start difference. First operand 269 states and 359 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 01:19:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:19,555 INFO L93 Difference]: Finished difference Result 417 states and 582 transitions. [2024-10-24 01:19:19,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:19,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 216 [2024-10-24 01:19:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:19,558 INFO L225 Difference]: With dead ends: 417 [2024-10-24 01:19:19,558 INFO L226 Difference]: Without dead ends: 274 [2024-10-24 01:19:19,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:19:19,559 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 4 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:19,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 754 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-24 01:19:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-10-24 01:19:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 217 states have (on average 1.2764976958525345) internal successors, (277), 221 states have internal predecessors, (277), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 01:19:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 363 transitions. [2024-10-24 01:19:19,573 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 363 transitions. Word has length 216 [2024-10-24 01:19:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:19,575 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 363 transitions. [2024-10-24 01:19:19,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 01:19:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 363 transitions. [2024-10-24 01:19:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-24 01:19:19,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:19,578 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:19,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 01:19:19,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:19,779 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:19,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:19,779 INFO L85 PathProgramCache]: Analyzing trace with hash 930837717, now seen corresponding path program 1 times [2024-10-24 01:19:19,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:19,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98427342] [2024-10-24 01:19:19,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:19,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-10-24 01:19:19,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:19,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98427342] [2024-10-24 01:19:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98427342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:19,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914285378] [2024-10-24 01:19:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:19,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:19,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:19,978 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:19,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 01:19:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 01:19:20,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-10-24 01:19:20,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:19:20,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914285378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:20,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:19:20,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-24 01:19:20,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972150764] [2024-10-24 01:19:20,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:20,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:20,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:20,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:20,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:20,195 INFO L87 Difference]: Start difference. First operand 274 states and 363 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 01:19:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:20,241 INFO L93 Difference]: Finished difference Result 421 states and 582 transitions. [2024-10-24 01:19:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:20,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 224 [2024-10-24 01:19:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:20,245 INFO L225 Difference]: With dead ends: 421 [2024-10-24 01:19:20,245 INFO L226 Difference]: Without dead ends: 273 [2024-10-24 01:19:20,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 263 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-10-24 01:19:20,246 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 5 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:20,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 744 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:20,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-24 01:19:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-10-24 01:19:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 217 states have (on average 1.262672811059908) internal successors, (274), 220 states have internal predecessors, (274), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 01:19:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 358 transitions. [2024-10-24 01:19:20,277 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 358 transitions. Word has length 224 [2024-10-24 01:19:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:20,278 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 358 transitions. [2024-10-24 01:19:20,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 01:19:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 358 transitions. [2024-10-24 01:19:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-24 01:19:20,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:20,281 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:20,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 01:19:20,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:20,482 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:20,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1128030971, now seen corresponding path program 1 times [2024-10-24 01:19:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457524026] [2024-10-24 01:19:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:20,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-10-24 01:19:20,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:20,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457524026] [2024-10-24 01:19:20,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457524026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:20,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:20,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225381933] [2024-10-24 01:19:20,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:20,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:20,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:20,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:20,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:20,683 INFO L87 Difference]: Start difference. First operand 273 states and 358 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 01:19:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:20,975 INFO L93 Difference]: Finished difference Result 419 states and 571 transitions. [2024-10-24 01:19:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:20,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 231 [2024-10-24 01:19:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:20,978 INFO L225 Difference]: With dead ends: 419 [2024-10-24 01:19:20,978 INFO L226 Difference]: Without dead ends: 272 [2024-10-24 01:19:20,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:20,981 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 62 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:20,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 464 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:19:20,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-24 01:19:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-10-24 01:19:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 219 states have internal predecessors, (273), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 01:19:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 355 transitions. [2024-10-24 01:19:21,002 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 355 transitions. Word has length 231 [2024-10-24 01:19:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:21,003 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 355 transitions. [2024-10-24 01:19:21,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 01:19:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 355 transitions. [2024-10-24 01:19:21,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-24 01:19:21,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:21,005 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:21,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:19:21,006 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:21,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:21,006 INFO L85 PathProgramCache]: Analyzing trace with hash -162714812, now seen corresponding path program 1 times [2024-10-24 01:19:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:21,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524338621] [2024-10-24 01:19:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:21,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-10-24 01:19:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524338621] [2024-10-24 01:19:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524338621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:21,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:21,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:19:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477576034] [2024-10-24 01:19:21,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:21,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:21,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:21,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:21,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:21,348 INFO L87 Difference]: Start difference. First operand 272 states and 355 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 01:19:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:21,951 INFO L93 Difference]: Finished difference Result 630 states and 851 transitions. [2024-10-24 01:19:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:19:21,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 234 [2024-10-24 01:19:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:21,958 INFO L225 Difference]: With dead ends: 630 [2024-10-24 01:19:21,958 INFO L226 Difference]: Without dead ends: 484 [2024-10-24 01:19:21,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:19:21,961 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 417 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:21,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 613 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:19:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-24 01:19:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 478. [2024-10-24 01:19:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 376 states have (on average 1.3111702127659575) internal successors, (493), 378 states have internal predecessors, (493), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 01:19:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 633 transitions. [2024-10-24 01:19:22,014 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 633 transitions. Word has length 234 [2024-10-24 01:19:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:22,015 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 633 transitions. [2024-10-24 01:19:22,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 01:19:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 633 transitions. [2024-10-24 01:19:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-24 01:19:22,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:22,020 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:22,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:19:22,020 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:22,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:22,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2125325853, now seen corresponding path program 1 times [2024-10-24 01:19:22,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:22,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498980939] [2024-10-24 01:19:22,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:22,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-24 01:19:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-24 01:19:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-24 01:19:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-24 01:19:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-10-24 01:19:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:22,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498980939] [2024-10-24 01:19:22,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498980939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:22,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:22,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:22,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272677640] [2024-10-24 01:19:22,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:22,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:22,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:22,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:22,254 INFO L87 Difference]: Start difference. First operand 478 states and 633 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-24 01:19:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:22,744 INFO L93 Difference]: Finished difference Result 1045 states and 1435 transitions. [2024-10-24 01:19:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:22,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 264 [2024-10-24 01:19:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:22,750 INFO L225 Difference]: With dead ends: 1045 [2024-10-24 01:19:22,750 INFO L226 Difference]: Without dead ends: 765 [2024-10-24 01:19:22,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-10-24 01:19:22,752 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 224 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:22,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 461 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:19:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-24 01:19:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 596. [2024-10-24 01:19:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 469 states have (on average 1.3198294243070363) internal successors, (619), 475 states have internal predecessors, (619), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2024-10-24 01:19:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 789 transitions. [2024-10-24 01:19:22,802 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 789 transitions. Word has length 264 [2024-10-24 01:19:22,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:22,803 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 789 transitions. [2024-10-24 01:19:22,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-24 01:19:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 789 transitions. [2024-10-24 01:19:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-10-24 01:19:22,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:22,808 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:22,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:19:22,809 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:22,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:22,809 INFO L85 PathProgramCache]: Analyzing trace with hash 965816563, now seen corresponding path program 1 times [2024-10-24 01:19:22,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:22,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864947923] [2024-10-24 01:19:22,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:22,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-24 01:19:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-24 01:19:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-24 01:19:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-24 01:19:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-10-24 01:19:23,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864947923] [2024-10-24 01:19:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864947923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:23,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113668475] [2024-10-24 01:19:23,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:23,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:23,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:23,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:23,014 INFO L87 Difference]: Start difference. First operand 596 states and 789 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-24 01:19:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:23,520 INFO L93 Difference]: Finished difference Result 1316 states and 1793 transitions. [2024-10-24 01:19:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:23,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 265 [2024-10-24 01:19:23,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:23,526 INFO L225 Difference]: With dead ends: 1316 [2024-10-24 01:19:23,526 INFO L226 Difference]: Without dead ends: 951 [2024-10-24 01:19:23,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-10-24 01:19:23,528 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 225 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:23,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 489 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:19:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-10-24 01:19:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 943. [2024-10-24 01:19:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 736 states have (on average 1.3478260869565217) internal successors, (992), 750 states have internal predecessors, (992), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2024-10-24 01:19:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1270 transitions. [2024-10-24 01:19:23,604 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1270 transitions. Word has length 265 [2024-10-24 01:19:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:23,606 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1270 transitions. [2024-10-24 01:19:23,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-24 01:19:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1270 transitions. [2024-10-24 01:19:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-24 01:19:23,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:23,610 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:23,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 01:19:23,610 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:23,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:23,611 INFO L85 PathProgramCache]: Analyzing trace with hash 542333624, now seen corresponding path program 1 times [2024-10-24 01:19:23,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:23,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169236518] [2024-10-24 01:19:23,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-24 01:19:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-24 01:19:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-24 01:19:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-10-24 01:19:23,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:23,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169236518] [2024-10-24 01:19:23,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169236518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:23,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:23,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:23,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626178775] [2024-10-24 01:19:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:23,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:23,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:23,805 INFO L87 Difference]: Start difference. First operand 943 states and 1270 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 01:19:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:24,350 INFO L93 Difference]: Finished difference Result 2195 states and 3032 transitions. [2024-10-24 01:19:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:24,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 266 [2024-10-24 01:19:24,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:24,363 INFO L225 Difference]: With dead ends: 2195 [2024-10-24 01:19:24,364 INFO L226 Difference]: Without dead ends: 1523 [2024-10-24 01:19:24,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-10-24 01:19:24,367 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 225 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:24,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 516 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:19:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2024-10-24 01:19:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1509. [2024-10-24 01:19:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1170 states have (on average 1.3743589743589744) internal successors, (1608), 1198 states have internal predecessors, (1608), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-10-24 01:19:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2070 transitions. [2024-10-24 01:19:24,512 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2070 transitions. Word has length 266 [2024-10-24 01:19:24,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:24,513 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2070 transitions. [2024-10-24 01:19:24,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 01:19:24,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2070 transitions. [2024-10-24 01:19:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-24 01:19:24,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:24,517 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:24,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 01:19:24,518 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:24,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash 147966838, now seen corresponding path program 1 times [2024-10-24 01:19:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:24,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052540728] [2024-10-24 01:19:24,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-24 01:19:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-24 01:19:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-24 01:19:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-10-24 01:19:24,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:24,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052540728] [2024-10-24 01:19:24,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052540728] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:24,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690454063] [2024-10-24 01:19:24,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:24,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:24,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:24,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:24,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 01:19:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:25,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 01:19:25,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-10-24 01:19:25,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:19:25,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690454063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:25,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:19:25,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-24 01:19:25,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880424297] [2024-10-24 01:19:25,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:25,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:25,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:25,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:25,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:19:25,183 INFO L87 Difference]: Start difference. First operand 1509 states and 2070 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 01:19:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:25,384 INFO L93 Difference]: Finished difference Result 2787 states and 3881 transitions. [2024-10-24 01:19:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:25,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 266 [2024-10-24 01:19:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:25,395 INFO L225 Difference]: With dead ends: 2787 [2024-10-24 01:19:25,395 INFO L226 Difference]: Without dead ends: 1509 [2024-10-24 01:19:25,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:19:25,399 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 31 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:25,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 679 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-10-24 01:19:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2024-10-24 01:19:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1170 states have (on average 1.353846153846154) internal successors, (1584), 1198 states have internal predecessors, (1584), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-10-24 01:19:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2046 transitions. [2024-10-24 01:19:25,560 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2046 transitions. Word has length 266 [2024-10-24 01:19:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:25,561 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2046 transitions. [2024-10-24 01:19:25,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 01:19:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2046 transitions. [2024-10-24 01:19:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-24 01:19:25,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:25,565 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:25,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 01:19:25,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-24 01:19:25,767 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:25,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash -338351429, now seen corresponding path program 1 times [2024-10-24 01:19:25,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:25,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726453701] [2024-10-24 01:19:25,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:25,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:25,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:25,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:25,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:25,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:25,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:25,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-24 01:19:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-24 01:19:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-24 01:19:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-10-24 01:19:26,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:26,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726453701] [2024-10-24 01:19:26,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726453701] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:26,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219555455] [2024-10-24 01:19:26,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:26,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:26,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:26,117 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:26,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 01:19:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:26,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 01:19:26,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-10-24 01:19:26,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:19:26,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219555455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:26,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:19:26,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-24 01:19:26,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805402820] [2024-10-24 01:19:26,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:26,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:26,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:26,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:26,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:19:26,408 INFO L87 Difference]: Start difference. First operand 1509 states and 2046 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 01:19:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:26,597 INFO L93 Difference]: Finished difference Result 2787 states and 3825 transitions. [2024-10-24 01:19:26,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:26,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 267 [2024-10-24 01:19:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:26,609 INFO L225 Difference]: With dead ends: 2787 [2024-10-24 01:19:26,610 INFO L226 Difference]: Without dead ends: 1557 [2024-10-24 01:19:26,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:19:26,615 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 7 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:26,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 687 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2024-10-24 01:19:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2024-10-24 01:19:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1210 states have (on average 1.3553719008264462) internal successors, (1640), 1238 states have internal predecessors, (1640), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-10-24 01:19:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2102 transitions. [2024-10-24 01:19:26,750 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2102 transitions. Word has length 267 [2024-10-24 01:19:26,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:26,751 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2102 transitions. [2024-10-24 01:19:26,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 01:19:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2102 transitions. [2024-10-24 01:19:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-10-24 01:19:26,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:26,755 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:26,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 01:19:26,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-24 01:19:26,957 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:26,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:26,957 INFO L85 PathProgramCache]: Analyzing trace with hash -8905584, now seen corresponding path program 1 times [2024-10-24 01:19:26,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:26,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809083981] [2024-10-24 01:19:26,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-24 01:19:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-24 01:19:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-24 01:19:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-10-24 01:19:27,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:27,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809083981] [2024-10-24 01:19:27,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809083981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:27,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:27,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:19:27,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801634165] [2024-10-24 01:19:27,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:27,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:19:27,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:27,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:19:27,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:19:27,452 INFO L87 Difference]: Start difference. First operand 1557 states and 2102 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 01:19:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:28,269 INFO L93 Difference]: Finished difference Result 2371 states and 3433 transitions. [2024-10-24 01:19:28,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:19:28,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 268 [2024-10-24 01:19:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:28,287 INFO L225 Difference]: With dead ends: 2371 [2024-10-24 01:19:28,287 INFO L226 Difference]: Without dead ends: 2369 [2024-10-24 01:19:28,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:19:28,289 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 180 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:28,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1498 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:19:28,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2024-10-24 01:19:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1605. [2024-10-24 01:19:28,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1242 states have (on average 1.3462157809983897) internal successors, (1672), 1278 states have internal predecessors, (1672), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2024-10-24 01:19:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2150 transitions. [2024-10-24 01:19:28,501 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2150 transitions. Word has length 268 [2024-10-24 01:19:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:28,502 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 2150 transitions. [2024-10-24 01:19:28,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 01:19:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2150 transitions. [2024-10-24 01:19:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-24 01:19:28,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:28,506 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:28,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 01:19:28,506 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:28,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash -767029101, now seen corresponding path program 1 times [2024-10-24 01:19:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305131188] [2024-10-24 01:19:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:28,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-24 01:19:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-24 01:19:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-24 01:19:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-24 01:19:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-24 01:19:28,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305131188] [2024-10-24 01:19:28,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305131188] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409030276] [2024-10-24 01:19:28,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:28,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:28,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:28,974 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:28,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 01:19:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 01:19:29,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 251 proven. 37 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-10-24 01:19:29,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-24 01:19:29,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409030276] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:29,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:29,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2024-10-24 01:19:29,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816323190] [2024-10-24 01:19:29,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:29,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 01:19:29,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:29,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 01:19:29,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-24 01:19:29,807 INFO L87 Difference]: Start difference. First operand 1605 states and 2150 transitions. Second operand has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2024-10-24 01:19:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:31,781 INFO L93 Difference]: Finished difference Result 3937 states and 5463 transitions. [2024-10-24 01:19:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 01:19:31,782 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 276 [2024-10-24 01:19:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:31,799 INFO L225 Difference]: With dead ends: 3937 [2024-10-24 01:19:31,799 INFO L226 Difference]: Without dead ends: 2611 [2024-10-24 01:19:31,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 597 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 01:19:31,806 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 304 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:31,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2382 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 01:19:31,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2024-10-24 01:19:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2383. [2024-10-24 01:19:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 1837 states have (on average 1.3331518780620577) internal successors, (2449), 1889 states have internal predecessors, (2449), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2024-10-24 01:19:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3169 transitions. [2024-10-24 01:19:32,010 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3169 transitions. Word has length 276 [2024-10-24 01:19:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:32,011 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 3169 transitions. [2024-10-24 01:19:32,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2024-10-24 01:19:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3169 transitions. [2024-10-24 01:19:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-24 01:19:32,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:32,016 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:32,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-24 01:19:32,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:32,217 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:32,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:32,218 INFO L85 PathProgramCache]: Analyzing trace with hash 194584916, now seen corresponding path program 1 times [2024-10-24 01:19:32,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:32,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750365667] [2024-10-24 01:19:32,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:32,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-24 01:19:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-24 01:19:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-24 01:19:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-24 01:19:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-10-24 01:19:32,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:32,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750365667] [2024-10-24 01:19:32,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750365667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:32,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798502467] [2024-10-24 01:19:32,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:32,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:32,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:32,427 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:32,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 01:19:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:32,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 01:19:32,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-10-24 01:19:32,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:19:32,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798502467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:32,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:19:32,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-24 01:19:32,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439260096] [2024-10-24 01:19:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:32,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:32,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:32,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:32,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:32,664 INFO L87 Difference]: Start difference. First operand 2383 states and 3169 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 01:19:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:32,863 INFO L93 Difference]: Finished difference Result 4600 states and 6215 transitions. [2024-10-24 01:19:32,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:32,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 276 [2024-10-24 01:19:32,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:32,876 INFO L225 Difference]: With dead ends: 4600 [2024-10-24 01:19:32,876 INFO L226 Difference]: Without dead ends: 2319 [2024-10-24 01:19:32,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 326 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-10-24 01:19:32,883 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 4 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:32,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 687 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-10-24 01:19:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2319. [2024-10-24 01:19:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2319 states, 1793 states have (on average 1.3156720580033463) internal successors, (2359), 1845 states have internal predecessors, (2359), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2024-10-24 01:19:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3043 transitions. [2024-10-24 01:19:33,137 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3043 transitions. Word has length 276 [2024-10-24 01:19:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:33,138 INFO L471 AbstractCegarLoop]: Abstraction has 2319 states and 3043 transitions. [2024-10-24 01:19:33,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 01:19:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3043 transitions. [2024-10-24 01:19:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-10-24 01:19:33,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:33,144 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:33,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-24 01:19:33,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:33,346 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:33,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2011160599, now seen corresponding path program 1 times [2024-10-24 01:19:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:33,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980216973] [2024-10-24 01:19:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 01:19:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 01:19:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 01:19:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-24 01:19:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-24 01:19:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-24 01:19:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-24 01:19:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-24 01:19:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-24 01:19:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-24 01:19:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-24 01:19:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-10-24 01:19:33,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:33,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980216973] [2024-10-24 01:19:33,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980216973] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:33,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541301481] [2024-10-24 01:19:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:33,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:33,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:33,568 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:33,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 01:19:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:33,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 01:19:33,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2024-10-24 01:19:33,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:19:33,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541301481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:33,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:19:33,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-24 01:19:33,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398977230] [2024-10-24 01:19:33,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:33,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:33,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:33,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:33,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:33,813 INFO L87 Difference]: Start difference. First operand 2319 states and 3043 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 01:19:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:34,017 INFO L93 Difference]: Finished difference Result 4382 states and 5856 transitions. [2024-10-24 01:19:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:34,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 279 [2024-10-24 01:19:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:34,033 INFO L225 Difference]: With dead ends: 4382 [2024-10-24 01:19:34,034 INFO L226 Difference]: Without dead ends: 2147 [2024-10-24 01:19:34,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 329 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-10-24 01:19:34,042 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 4 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:34,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 715 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:34,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2024-10-24 01:19:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2147. [2024-10-24 01:19:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1651 states have (on average 1.3095093882495457) internal successors, (2162), 1703 states have internal predecessors, (2162), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2024-10-24 01:19:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2808 transitions. [2024-10-24 01:19:34,254 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2808 transitions. Word has length 279 [2024-10-24 01:19:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:34,255 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 2808 transitions. [2024-10-24 01:19:34,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 01:19:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2808 transitions. [2024-10-24 01:19:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-24 01:19:34,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:34,258 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:34,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-24 01:19:34,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:34,459 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:34,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:34,460 INFO L85 PathProgramCache]: Analyzing trace with hash 435768030, now seen corresponding path program 1 times [2024-10-24 01:19:34,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:34,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629751211] [2024-10-24 01:19:34,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:34,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-24 01:19:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-24 01:19:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-24 01:19:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-24 01:19:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-24 01:19:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-24 01:19:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2024-10-24 01:19:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629751211] [2024-10-24 01:19:34,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629751211] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613387659] [2024-10-24 01:19:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:34,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:34,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:34,882 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:34,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-24 01:19:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:35,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 01:19:35,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-10-24 01:19:35,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:19:35,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613387659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:35,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:19:35,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-10-24 01:19:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786702615] [2024-10-24 01:19:35,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:35,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:19:35,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:35,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:19:35,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:19:35,269 INFO L87 Difference]: Start difference. First operand 2147 states and 2808 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 01:19:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:35,762 INFO L93 Difference]: Finished difference Result 4753 states and 6223 transitions. [2024-10-24 01:19:35,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:19:35,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 291 [2024-10-24 01:19:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:35,780 INFO L225 Difference]: With dead ends: 4753 [2024-10-24 01:19:35,780 INFO L226 Difference]: Without dead ends: 3163 [2024-10-24 01:19:35,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-10-24 01:19:35,788 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 128 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:35,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1724 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:19:35,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2024-10-24 01:19:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3149. [2024-10-24 01:19:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 2414 states have (on average 1.3024026512013256) internal successors, (3144), 2494 states have internal predecessors, (3144), 467 states have call successors, (467), 267 states have call predecessors, (467), 267 states have return successors, (467), 395 states have call predecessors, (467), 467 states have call successors, (467) [2024-10-24 01:19:36,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4078 transitions. [2024-10-24 01:19:36,045 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4078 transitions. Word has length 291 [2024-10-24 01:19:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:36,046 INFO L471 AbstractCegarLoop]: Abstraction has 3149 states and 4078 transitions. [2024-10-24 01:19:36,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 01:19:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4078 transitions. [2024-10-24 01:19:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-10-24 01:19:36,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:36,050 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:36,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-24 01:19:36,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-24 01:19:36,255 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:36,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:36,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1216360965, now seen corresponding path program 1 times [2024-10-24 01:19:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:36,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472957645] [2024-10-24 01:19:36,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:36,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-24 01:19:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-24 01:19:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-24 01:19:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-24 01:19:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-10-24 01:19:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-24 01:19:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-10-24 01:19:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:36,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472957645] [2024-10-24 01:19:36,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472957645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:36,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:36,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:19:36,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322315409] [2024-10-24 01:19:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:36,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:19:36,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:36,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:19:36,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:19:36,615 INFO L87 Difference]: Start difference. First operand 3149 states and 4078 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 01:19:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:37,222 INFO L93 Difference]: Finished difference Result 6125 states and 8120 transitions. [2024-10-24 01:19:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:19:37,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 297 [2024-10-24 01:19:37,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:37,241 INFO L225 Difference]: With dead ends: 6125 [2024-10-24 01:19:37,241 INFO L226 Difference]: Without dead ends: 3473 [2024-10-24 01:19:37,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:19:37,250 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 99 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:37,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 822 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:19:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3473 states. [2024-10-24 01:19:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3473 to 3405. [2024-10-24 01:19:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3405 states, 2622 states have (on average 1.315026697177727) internal successors, (3448), 2702 states have internal predecessors, (3448), 515 states have call successors, (515), 267 states have call predecessors, (515), 267 states have return successors, (515), 443 states have call predecessors, (515), 515 states have call successors, (515) [2024-10-24 01:19:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 4478 transitions. [2024-10-24 01:19:37,623 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 4478 transitions. Word has length 297 [2024-10-24 01:19:37,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:37,624 INFO L471 AbstractCegarLoop]: Abstraction has 3405 states and 4478 transitions. [2024-10-24 01:19:37,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 01:19:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 4478 transitions. [2024-10-24 01:19:37,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-10-24 01:19:37,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:37,628 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:37,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-24 01:19:37,628 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:37,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:37,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1248191351, now seen corresponding path program 1 times [2024-10-24 01:19:37,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:37,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987037306] [2024-10-24 01:19:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:37,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-24 01:19:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-24 01:19:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-24 01:19:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-24 01:19:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-24 01:19:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-10-24 01:19:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:37,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-24 01:19:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2024-10-24 01:19:38,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:38,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987037306] [2024-10-24 01:19:38,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987037306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:38,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:38,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:19:38,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942150846] [2024-10-24 01:19:38,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:38,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:19:38,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:38,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:19:38,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:19:38,004 INFO L87 Difference]: Start difference. First operand 3405 states and 4478 transitions. Second operand has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 01:19:38,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:38,636 INFO L93 Difference]: Finished difference Result 6158 states and 8150 transitions. [2024-10-24 01:19:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:19:38,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 297 [2024-10-24 01:19:38,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:38,668 INFO L225 Difference]: With dead ends: 6158 [2024-10-24 01:19:38,668 INFO L226 Difference]: Without dead ends: 3355 [2024-10-24 01:19:38,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:19:38,677 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 61 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:38,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 764 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:19:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2024-10-24 01:19:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 3355. [2024-10-24 01:19:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 2581 states have (on average 1.3115071677644323) internal successors, (3385), 2656 states have internal predecessors, (3385), 511 states have call successors, (511), 263 states have call predecessors, (511), 262 states have return successors, (510), 442 states have call predecessors, (510), 510 states have call successors, (510) [2024-10-24 01:19:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4406 transitions. [2024-10-24 01:19:38,941 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4406 transitions. Word has length 297 [2024-10-24 01:19:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:38,942 INFO L471 AbstractCegarLoop]: Abstraction has 3355 states and 4406 transitions. [2024-10-24 01:19:38,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 01:19:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4406 transitions. [2024-10-24 01:19:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-10-24 01:19:38,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:38,947 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:38,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-24 01:19:38,947 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:38,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1894221007, now seen corresponding path program 1 times [2024-10-24 01:19:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:38,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247809025] [2024-10-24 01:19:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:38,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-24 01:19:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-24 01:19:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-24 01:19:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-24 01:19:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-24 01:19:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-24 01:19:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-10-24 01:19:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-10-24 01:19:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-10-24 01:19:39,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:39,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247809025] [2024-10-24 01:19:39,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247809025] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:39,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43300927] [2024-10-24 01:19:39,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:39,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:39,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:39,606 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:39,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-24 01:19:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 01:19:39,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 189 proven. 4 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-10-24 01:19:40,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-10-24 01:19:40,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43300927] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:40,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 01:19:40,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 10] total 21 [2024-10-24 01:19:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978109192] [2024-10-24 01:19:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:40,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 01:19:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:40,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 01:19:40,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:19:40,288 INFO L87 Difference]: Start difference. First operand 3355 states and 4406 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-24 01:19:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:41,549 INFO L93 Difference]: Finished difference Result 10463 states and 13687 transitions. [2024-10-24 01:19:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 01:19:41,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 302 [2024-10-24 01:19:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:41,583 INFO L225 Difference]: With dead ends: 10463 [2024-10-24 01:19:41,583 INFO L226 Difference]: Without dead ends: 7620 [2024-10-24 01:19:41,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 651 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 01:19:41,595 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 662 mSDsluCounter, 2345 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:41,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 2717 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:19:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2024-10-24 01:19:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 5440. [2024-10-24 01:19:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 4164 states have (on average 1.3064361191162344) internal successors, (5440), 4284 states have internal predecessors, (5440), 852 states have call successors, (852), 424 states have call predecessors, (852), 423 states have return successors, (851), 738 states have call predecessors, (851), 851 states have call successors, (851) [2024-10-24 01:19:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 7143 transitions. [2024-10-24 01:19:42,198 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 7143 transitions. Word has length 302 [2024-10-24 01:19:42,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:42,199 INFO L471 AbstractCegarLoop]: Abstraction has 5440 states and 7143 transitions. [2024-10-24 01:19:42,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-24 01:19:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 7143 transitions. [2024-10-24 01:19:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-10-24 01:19:42,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:42,204 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:42,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-24 01:19:42,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-24 01:19:42,405 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:42,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:42,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1218887887, now seen corresponding path program 1 times [2024-10-24 01:19:42,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:42,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069735386] [2024-10-24 01:19:42,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:42,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-24 01:19:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-24 01:19:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-24 01:19:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-24 01:19:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-24 01:19:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-24 01:19:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-10-24 01:19:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-10-24 01:19:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-10-24 01:19:43,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:43,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069735386] [2024-10-24 01:19:43,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069735386] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:43,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440680651] [2024-10-24 01:19:43,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:43,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:43,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:43,370 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:43,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-24 01:19:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:43,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 01:19:43,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-10-24 01:19:43,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:19:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440680651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:43,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:19:43,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 12 [2024-10-24 01:19:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054488057] [2024-10-24 01:19:43,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:43,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:19:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:19:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:19:43,679 INFO L87 Difference]: Start difference. First operand 5440 states and 7143 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-24 01:19:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:44,230 INFO L93 Difference]: Finished difference Result 10494 states and 13773 transitions. [2024-10-24 01:19:44,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:19:44,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 302 [2024-10-24 01:19:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:44,263 INFO L225 Difference]: With dead ends: 10494 [2024-10-24 01:19:44,263 INFO L226 Difference]: Without dead ends: 5518 [2024-10-24 01:19:44,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-24 01:19:44,280 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 122 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:44,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1697 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:19:44,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2024-10-24 01:19:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 5276. [2024-10-24 01:19:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5276 states, 4040 states have (on average 1.299009900990099) internal successors, (5248), 4156 states have internal predecessors, (5248), 816 states have call successors, (816), 420 states have call predecessors, (816), 419 states have return successors, (815), 706 states have call predecessors, (815), 815 states have call successors, (815) [2024-10-24 01:19:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 6879 transitions. [2024-10-24 01:19:44,715 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 6879 transitions. Word has length 302 [2024-10-24 01:19:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:44,715 INFO L471 AbstractCegarLoop]: Abstraction has 5276 states and 6879 transitions. [2024-10-24 01:19:44,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-24 01:19:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 6879 transitions. [2024-10-24 01:19:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-10-24 01:19:44,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:44,719 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:44,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-24 01:19:44,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-24 01:19:44,920 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:44,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:44,920 INFO L85 PathProgramCache]: Analyzing trace with hash 621231855, now seen corresponding path program 1 times [2024-10-24 01:19:44,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:44,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684167849] [2024-10-24 01:19:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-24 01:19:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-24 01:19:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-24 01:19:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-24 01:19:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-24 01:19:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-24 01:19:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-24 01:19:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-24 01:19:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-10-24 01:19:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-10-24 01:19:45,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:45,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684167849] [2024-10-24 01:19:45,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684167849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:45,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:45,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:19:45,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533888168] [2024-10-24 01:19:45,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:45,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:45,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:45,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:45,137 INFO L87 Difference]: Start difference. First operand 5276 states and 6879 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 01:19:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:46,017 INFO L93 Difference]: Finished difference Result 8879 states and 11621 transitions. [2024-10-24 01:19:46,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:19:46,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 309 [2024-10-24 01:19:46,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:46,040 INFO L225 Difference]: With dead ends: 8879 [2024-10-24 01:19:46,041 INFO L226 Difference]: Without dead ends: 4363 [2024-10-24 01:19:46,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:19:46,051 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 472 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:46,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 746 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:19:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2024-10-24 01:19:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 4337. [2024-10-24 01:19:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4337 states, 3326 states have (on average 1.280216476247745) internal successors, (4258), 3420 states have internal predecessors, (4258), 665 states have call successors, (665), 345 states have call predecessors, (665), 345 states have return successors, (665), 571 states have call predecessors, (665), 665 states have call successors, (665) [2024-10-24 01:19:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 5588 transitions. [2024-10-24 01:19:46,372 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 5588 transitions. Word has length 309 [2024-10-24 01:19:46,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:46,373 INFO L471 AbstractCegarLoop]: Abstraction has 4337 states and 5588 transitions. [2024-10-24 01:19:46,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 01:19:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 5588 transitions. [2024-10-24 01:19:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-10-24 01:19:46,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:46,384 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:19:46,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-24 01:19:46,384 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:46,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:46,385 INFO L85 PathProgramCache]: Analyzing trace with hash 778601870, now seen corresponding path program 1 times [2024-10-24 01:19:46,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:46,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054546243] [2024-10-24 01:19:46,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:46,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:19:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:19:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 01:19:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 01:19:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:19:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 01:19:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:19:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 01:19:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 01:19:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 01:19:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:19:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-24 01:19:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 01:19:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-24 01:19:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-24 01:19:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-24 01:19:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-24 01:19:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-24 01:19:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-24 01:19:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-24 01:19:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-24 01:19:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-24 01:19:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-24 01:19:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-10-24 01:19:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-24 01:19:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-10-24 01:19:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2024-10-24 01:19:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-24 01:19:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-10-24 01:19:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-10-24 01:19:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2024-10-24 01:19:47,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:47,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054546243] [2024-10-24 01:19:47,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054546243] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727971013] [2024-10-24 01:19:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:47,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:47,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:47,804 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:47,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-24 01:19:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:48,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-24 01:19:48,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 211 proven. 121 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2024-10-24 01:19:49,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-24 01:19:50,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727971013] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:50,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:50,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 19] total 48 [2024-10-24 01:19:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682039534] [2024-10-24 01:19:50,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:50,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-24 01:19:50,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:50,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-24 01:19:50,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2072, Unknown=0, NotChecked=0, Total=2256 [2024-10-24 01:19:50,125 INFO L87 Difference]: Start difference. First operand 4337 states and 5588 transitions. Second operand has 48 states, 46 states have (on average 6.304347826086956) internal successors, (290), 43 states have internal predecessors, (290), 20 states have call successors, (72), 8 states have call predecessors, (72), 12 states have return successors, (69), 22 states have call predecessors, (69), 20 states have call successors, (69)