./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e96a4dadf08c19b3d92d901d7f9116f0323f4fb1660ac2537112df0afe321751 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:12:53,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:12:53,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:12:53,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:12:53,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:12:53,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:12:53,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:12:53,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:12:53,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:12:53,912 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:12:53,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:12:53,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:12:53,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:12:53,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:12:53,914 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:12:53,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:12:53,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:12:53,915 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:12:53,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:12:53,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:12:53,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:12:53,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:12:53,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:12:53,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:12:53,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:12:53,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:12:53,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:12:53,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:12:53,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:12:53,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:12:53,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:12:53,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:12:53,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:12:53,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:12:53,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:12:53,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:12:53,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:12:53,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:12:53,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:12:53,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:12:53,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:12:53,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:12:53,922 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-clean/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-clean/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 -> e96a4dadf08c19b3d92d901d7f9116f0323f4fb1660ac2537112df0afe321751 [2024-10-11 03:12:54,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:12:54,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:12:54,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:12:54,156 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:12:54,156 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:12:54,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2024-10-11 03:12:55,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:12:55,567 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:12:55,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2024-10-11 03:12:55,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/73cd26e94/643f858a83a84429bf363da23e48e742/FLAG615835ef9 [2024-10-11 03:12:55,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/73cd26e94/643f858a83a84429bf363da23e48e742 [2024-10-11 03:12:55,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:12:55,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:12:55,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:12:55,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:12:55,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:12:55,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:12:55" (1/1) ... [2024-10-11 03:12:55,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668d3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:55, skipping insertion in model container [2024-10-11 03:12:55,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:12:55" (1/1) ... [2024-10-11 03:12:56,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:12:56,164 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/systemc/token_ring.03.cil-1.c[671,684] [2024-10-11 03:12:56,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:12:56,224 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:12:56,232 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/systemc/token_ring.03.cil-1.c[671,684] [2024-10-11 03:12:56,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:12:56,267 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:12:56,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56 WrapperNode [2024-10-11 03:12:56,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:12:56,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:12:56,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:12:56,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:12:56,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (1/1) ... [2024-10-11 03:12:56,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (1/1) ... [2024-10-11 03:12:56,300 INFO L138 Inliner]: procedures = 34, calls = 41, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 345 [2024-10-11 03:12:56,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:12:56,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:12:56,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:12:56,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:12:56,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (1/1) ... [2024-10-11 03:12:56,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (1/1) ... [2024-10-11 03:12:56,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (1/1) ... [2024-10-11 03:12:56,329 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:12:56,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (1/1) ... [2024-10-11 03:12:56,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (1/1) ... [2024-10-11 03:12:56,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (1/1) ... [2024-10-11 03:12:56,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (1/1) ... [2024-10-11 03:12:56,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (1/1) ... [2024-10-11 03:12:56,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (1/1) ... [2024-10-11 03:12:56,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:12:56,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:12:56,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:12:56,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:12:56,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (1/1) ... [2024-10-11 03:12:56,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:12:56,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:12:56,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:12:56,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:12:56,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:12:56,413 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 03:12:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 03:12:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 03:12:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 03:12:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 03:12:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 03:12:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 03:12:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 03:12:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 03:12:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 03:12:56,415 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 03:12:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 03:12:56,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:12:56,415 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 03:12:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 03:12:56,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:12:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:12:56,483 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:12:56,485 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:12:56,891 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-11 03:12:56,891 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:12:56,919 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:12:56,919 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 03:12:56,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:56 BoogieIcfgContainer [2024-10-11 03:12:56,920 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:12:56,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:12:56,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:12:56,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:12:56,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:12:55" (1/3) ... [2024-10-11 03:12:56,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48aca686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:12:56, skipping insertion in model container [2024-10-11 03:12:56,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:56" (2/3) ... [2024-10-11 03:12:56,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48aca686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:12:56, skipping insertion in model container [2024-10-11 03:12:56,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:56" (3/3) ... [2024-10-11 03:12:56,927 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2024-10-11 03:12:56,939 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:12:56,939 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:12:56,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:12:57,000 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;@334e923a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:12:57,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:12:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 121 states have (on average 1.6859504132231404) internal successors, (204), 125 states have internal predecessors, (204), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 03:12:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:12:57,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:57,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:12:57,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:57,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1762745251, now seen corresponding path program 1 times [2024-10-11 03:12:57,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:57,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388687537] [2024-10-11 03:12:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:57,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:57,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:57,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:12:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:57,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:12:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:12:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:12:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:57,413 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-11 03:12:57,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:57,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388687537] [2024-10-11 03:12:57,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388687537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:57,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:57,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:12:57,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832949537] [2024-10-11 03:12:57,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:57,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:12:57,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:57,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:12:57,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:12:57,444 INFO L87 Difference]: Start difference. First operand has 149 states, 121 states have (on average 1.6859504132231404) internal successors, (204), 125 states have internal predecessors, (204), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:12:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:58,044 INFO L93 Difference]: Finished difference Result 331 states and 545 transitions. [2024-10-11 03:12:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:12:58,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 03:12:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:58,054 INFO L225 Difference]: With dead ends: 331 [2024-10-11 03:12:58,054 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 03:12:58,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:12:58,059 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 352 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:58,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 285 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:12:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 03:12:58,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 146. [2024-10-11 03:12:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.5666666666666667) internal successors, (188), 122 states have internal predecessors, (188), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 03:12:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2024-10-11 03:12:58,109 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 71 [2024-10-11 03:12:58,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:58,110 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2024-10-11 03:12:58,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:12:58,111 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2024-10-11 03:12:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:12:58,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:58,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:12:58,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:12:58,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:58,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1817138149, now seen corresponding path program 1 times [2024-10-11 03:12:58,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:58,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245248705] [2024-10-11 03:12:58,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:58,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:58,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:58,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:12:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:58,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:12:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:58,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:12:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:58,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:12:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:58,277 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-11 03:12:58,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245248705] [2024-10-11 03:12:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245248705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:58,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:58,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:12:58,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176740474] [2024-10-11 03:12:58,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:58,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:12:58,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:58,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:12:58,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:12:58,284 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:12:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:59,023 INFO L93 Difference]: Finished difference Result 501 states and 788 transitions. [2024-10-11 03:12:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:12:59,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 03:12:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:59,028 INFO L225 Difference]: With dead ends: 501 [2024-10-11 03:12:59,028 INFO L226 Difference]: Without dead ends: 364 [2024-10-11 03:12:59,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:12:59,034 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 518 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:59,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 470 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:12:59,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-11 03:12:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 283. [2024-10-11 03:12:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 238 states have (on average 1.5756302521008403) internal successors, (375), 241 states have internal predecessors, (375), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2024-10-11 03:12:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 438 transitions. [2024-10-11 03:12:59,071 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 438 transitions. Word has length 71 [2024-10-11 03:12:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:59,071 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 438 transitions. [2024-10-11 03:12:59,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:12:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 438 transitions. [2024-10-11 03:12:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:12:59,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:59,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:12:59,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:12:59,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:59,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2081001697, now seen corresponding path program 1 times [2024-10-11 03:12:59,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:59,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641098668] [2024-10-11 03:12:59,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:59,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:59,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:12:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:59,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:12:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:59,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:12:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:59,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:12:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:59,268 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-11 03:12:59,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:59,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641098668] [2024-10-11 03:12:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641098668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:59,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:59,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:12:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780903992] [2024-10-11 03:12:59,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:59,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:12:59,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:59,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:12:59,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:12:59,271 INFO L87 Difference]: Start difference. First operand 283 states and 438 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:00,281 INFO L93 Difference]: Finished difference Result 818 states and 1284 transitions. [2024-10-11 03:13:00,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:13:00,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 03:13:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:00,285 INFO L225 Difference]: With dead ends: 818 [2024-10-11 03:13:00,285 INFO L226 Difference]: Without dead ends: 544 [2024-10-11 03:13:00,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:13:00,287 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 523 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:00,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 886 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:13:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-10-11 03:13:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 412. [2024-10-11 03:13:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 348 states have (on average 1.5689655172413792) internal successors, (546), 352 states have internal predecessors, (546), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-10-11 03:13:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 635 transitions. [2024-10-11 03:13:00,331 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 635 transitions. Word has length 71 [2024-10-11 03:13:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:00,331 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 635 transitions. [2024-10-11 03:13:00,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 635 transitions. [2024-10-11 03:13:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:13:00,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:00,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:13:00,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:13:00,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:00,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1780236513, now seen corresponding path program 1 times [2024-10-11 03:13:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:00,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731537305] [2024-10-11 03:13:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:00,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:00,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:00,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:00,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:00,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:00,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:00,474 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-11 03:13:00,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:00,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731537305] [2024-10-11 03:13:00,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731537305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:00,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:00,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:00,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780615451] [2024-10-11 03:13:00,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:00,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:00,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:00,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:00,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:00,476 INFO L87 Difference]: Start difference. First operand 412 states and 635 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:00,992 INFO L93 Difference]: Finished difference Result 945 states and 1483 transitions. [2024-10-11 03:13:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:13:00,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 03:13:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:00,995 INFO L225 Difference]: With dead ends: 945 [2024-10-11 03:13:00,996 INFO L226 Difference]: Without dead ends: 542 [2024-10-11 03:13:01,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:13:01,002 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 390 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:01,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 436 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:13:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-10-11 03:13:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 412. [2024-10-11 03:13:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 348 states have (on average 1.5603448275862069) internal successors, (543), 352 states have internal predecessors, (543), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-10-11 03:13:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 632 transitions. [2024-10-11 03:13:01,028 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 632 transitions. Word has length 71 [2024-10-11 03:13:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:01,028 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 632 transitions. [2024-10-11 03:13:01,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 632 transitions. [2024-10-11 03:13:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:13:01,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:01,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:13:01,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:13:01,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:01,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:01,030 INFO L85 PathProgramCache]: Analyzing trace with hash -519319263, now seen corresponding path program 1 times [2024-10-11 03:13:01,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:01,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434383032] [2024-10-11 03:13:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:01,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:01,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:01,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:01,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:01,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:01,155 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-11 03:13:01,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:01,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434383032] [2024-10-11 03:13:01,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434383032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:01,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:01,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:01,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623765707] [2024-10-11 03:13:01,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:01,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:01,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:01,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:01,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:01,157 INFO L87 Difference]: Start difference. First operand 412 states and 632 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:02,159 INFO L93 Difference]: Finished difference Result 1364 states and 2117 transitions. [2024-10-11 03:13:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:13:02,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 03:13:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:02,165 INFO L225 Difference]: With dead ends: 1364 [2024-10-11 03:13:02,165 INFO L226 Difference]: Without dead ends: 961 [2024-10-11 03:13:02,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:13:02,167 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 630 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:02,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 877 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:13:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2024-10-11 03:13:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 672. [2024-10-11 03:13:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 572 states have (on average 1.555944055944056) internal successors, (890), 578 states have internal predecessors, (890), 65 states have call successors, (65), 31 states have call predecessors, (65), 34 states have return successors, (76), 66 states have call predecessors, (76), 63 states have call successors, (76) [2024-10-11 03:13:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1031 transitions. [2024-10-11 03:13:02,226 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1031 transitions. Word has length 71 [2024-10-11 03:13:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:02,226 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 1031 transitions. [2024-10-11 03:13:02,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1031 transitions. [2024-10-11 03:13:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:13:02,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:02,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:13:02,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:13:02,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:02,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:02,229 INFO L85 PathProgramCache]: Analyzing trace with hash -478644513, now seen corresponding path program 1 times [2024-10-11 03:13:02,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:02,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550334277] [2024-10-11 03:13:02,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:02,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:02,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:02,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:02,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:02,354 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-11 03:13:02,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:02,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550334277] [2024-10-11 03:13:02,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550334277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:02,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:02,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:02,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771748181] [2024-10-11 03:13:02,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:02,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:02,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:02,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:02,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:02,356 INFO L87 Difference]: Start difference. First operand 672 states and 1031 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:03,369 INFO L93 Difference]: Finished difference Result 2296 states and 3554 transitions. [2024-10-11 03:13:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:13:03,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 03:13:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:03,377 INFO L225 Difference]: With dead ends: 2296 [2024-10-11 03:13:03,377 INFO L226 Difference]: Without dead ends: 1633 [2024-10-11 03:13:03,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:13:03,380 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 529 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:03,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 873 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:13:03,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-10-11 03:13:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1149. [2024-10-11 03:13:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 979 states have (on average 1.5423901940755873) internal successors, (1510), 989 states have internal predecessors, (1510), 107 states have call successors, (107), 55 states have call predecessors, (107), 62 states have return successors, (140), 112 states have call predecessors, (140), 105 states have call successors, (140) [2024-10-11 03:13:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1757 transitions. [2024-10-11 03:13:03,454 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1757 transitions. Word has length 71 [2024-10-11 03:13:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:03,454 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1757 transitions. [2024-10-11 03:13:03,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1757 transitions. [2024-10-11 03:13:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:13:03,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:03,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:13:03,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:13:03,456 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:03,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash 908140897, now seen corresponding path program 1 times [2024-10-11 03:13:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:03,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69442189] [2024-10-11 03:13:03,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:03,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:03,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:03,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:03,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:03,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:03,548 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-11 03:13:03,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:03,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69442189] [2024-10-11 03:13:03,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69442189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:03,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:03,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425315689] [2024-10-11 03:13:03,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:03,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:03,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:03,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:03,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:03,550 INFO L87 Difference]: Start difference. First operand 1149 states and 1757 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:04,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:04,030 INFO L93 Difference]: Finished difference Result 2583 states and 3996 transitions. [2024-10-11 03:13:04,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:13:04,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 03:13:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:04,037 INFO L225 Difference]: With dead ends: 2583 [2024-10-11 03:13:04,037 INFO L226 Difference]: Without dead ends: 1443 [2024-10-11 03:13:04,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:13:04,040 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 448 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:04,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 361 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:13:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2024-10-11 03:13:04,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1149. [2024-10-11 03:13:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 979 states have (on average 1.533197139938713) internal successors, (1501), 989 states have internal predecessors, (1501), 107 states have call successors, (107), 55 states have call predecessors, (107), 62 states have return successors, (140), 112 states have call predecessors, (140), 105 states have call successors, (140) [2024-10-11 03:13:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1748 transitions. [2024-10-11 03:13:04,099 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1748 transitions. Word has length 71 [2024-10-11 03:13:04,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:04,099 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1748 transitions. [2024-10-11 03:13:04,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1748 transitions. [2024-10-11 03:13:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:13:04,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:04,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:13:04,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:13:04,101 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:04,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:04,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1784159903, now seen corresponding path program 1 times [2024-10-11 03:13:04,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:04,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326808382] [2024-10-11 03:13:04,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:04,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:04,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:04,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:04,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:04,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:04,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:04,198 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-11 03:13:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:04,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326808382] [2024-10-11 03:13:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326808382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:04,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:04,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:04,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848577431] [2024-10-11 03:13:04,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:04,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:04,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:04,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:04,200 INFO L87 Difference]: Start difference. First operand 1149 states and 1748 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:05,160 INFO L93 Difference]: Finished difference Result 3877 states and 5922 transitions. [2024-10-11 03:13:05,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:13:05,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 03:13:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:05,173 INFO L225 Difference]: With dead ends: 3877 [2024-10-11 03:13:05,173 INFO L226 Difference]: Without dead ends: 2737 [2024-10-11 03:13:05,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:13:05,177 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 513 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:05,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 877 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:13:05,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2024-10-11 03:13:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2151. [2024-10-11 03:13:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 1845 states have (on average 1.5289972899728996) internal successors, (2821), 1863 states have internal predecessors, (2821), 187 states have call successors, (187), 103 states have call predecessors, (187), 118 states have return successors, (282), 200 states have call predecessors, (282), 185 states have call successors, (282) [2024-10-11 03:13:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 3290 transitions. [2024-10-11 03:13:05,308 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 3290 transitions. Word has length 71 [2024-10-11 03:13:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:05,308 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 3290 transitions. [2024-10-11 03:13:05,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3290 transitions. [2024-10-11 03:13:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:13:05,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:05,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:13:05,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:13:05,313 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:05,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:05,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2066906719, now seen corresponding path program 1 times [2024-10-11 03:13:05,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:05,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868896928] [2024-10-11 03:13:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:05,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:05,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:05,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:05,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:05,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:05,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:05,383 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-11 03:13:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:05,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868896928] [2024-10-11 03:13:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868896928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:05,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:05,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:13:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209537901] [2024-10-11 03:13:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:05,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:13:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:05,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:13:05,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:13:05,386 INFO L87 Difference]: Start difference. First operand 2151 states and 3290 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:06,242 INFO L93 Difference]: Finished difference Result 6099 states and 9366 transitions. [2024-10-11 03:13:06,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:13:06,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 03:13:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:06,256 INFO L225 Difference]: With dead ends: 6099 [2024-10-11 03:13:06,256 INFO L226 Difference]: Without dead ends: 3958 [2024-10-11 03:13:06,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:13:06,262 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 660 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:06,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 623 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:13:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2024-10-11 03:13:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 3237. [2024-10-11 03:13:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3237 states, 2768 states have (on average 1.5122832369942196) internal successors, (4186), 2803 states have internal predecessors, (4186), 288 states have call successors, (288), 157 states have call predecessors, (288), 180 states have return successors, (411), 292 states have call predecessors, (411), 286 states have call successors, (411) [2024-10-11 03:13:06,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 4885 transitions. [2024-10-11 03:13:06,442 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 4885 transitions. Word has length 71 [2024-10-11 03:13:06,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:06,443 INFO L471 AbstractCegarLoop]: Abstraction has 3237 states and 4885 transitions. [2024-10-11 03:13:06,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 4885 transitions. [2024-10-11 03:13:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 03:13:06,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:06,450 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:13:06,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:13:06,451 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:06,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash 214156769, now seen corresponding path program 1 times [2024-10-11 03:13:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:06,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635646994] [2024-10-11 03:13:06,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:06,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:06,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:06,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:06,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:06,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 03:13:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:13:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:06,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635646994] [2024-10-11 03:13:06,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635646994] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:13:06,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313744568] [2024-10-11 03:13:06,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:06,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:06,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:06,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:13:06,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:13:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:06,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:13:06,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:13:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 03:13:06,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:13:06,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313744568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:06,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:13:06,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 03:13:06,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605455485] [2024-10-11 03:13:06,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:06,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:13:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:06,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:13:06,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:06,707 INFO L87 Difference]: Start difference. First operand 3237 states and 4885 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:13:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:07,085 INFO L93 Difference]: Finished difference Result 9610 states and 14599 transitions. [2024-10-11 03:13:07,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:13:07,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2024-10-11 03:13:07,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:07,107 INFO L225 Difference]: With dead ends: 9610 [2024-10-11 03:13:07,107 INFO L226 Difference]: Without dead ends: 6383 [2024-10-11 03:13:07,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:07,116 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 180 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:07,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 424 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:13:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2024-10-11 03:13:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 6353. [2024-10-11 03:13:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6353 states, 5436 states have (on average 1.5068064753495216) internal successors, (8191), 5504 states have internal predecessors, (8191), 556 states have call successors, (556), 313 states have call predecessors, (556), 360 states have return successors, (789), 551 states have call predecessors, (789), 554 states have call successors, (789) [2024-10-11 03:13:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6353 states to 6353 states and 9536 transitions. [2024-10-11 03:13:07,482 INFO L78 Accepts]: Start accepts. Automaton has 6353 states and 9536 transitions. Word has length 115 [2024-10-11 03:13:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:07,483 INFO L471 AbstractCegarLoop]: Abstraction has 6353 states and 9536 transitions. [2024-10-11 03:13:07,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:13:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 6353 states and 9536 transitions. [2024-10-11 03:13:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 03:13:07,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:07,491 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:13:07,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:13:07,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 03:13:07,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:07,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:07,693 INFO L85 PathProgramCache]: Analyzing trace with hash 895645087, now seen corresponding path program 1 times [2024-10-11 03:13:07,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:07,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931730922] [2024-10-11 03:13:07,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:07,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:07,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:07,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:07,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:07,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:07,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:07,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:07,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 03:13:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:13:07,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:07,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931730922] [2024-10-11 03:13:07,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931730922] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:13:07,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521430165] [2024-10-11 03:13:07,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:07,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:07,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:07,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:13:07,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:13:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:07,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:13:07,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:13:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 03:13:07,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:13:07,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521430165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:07,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:13:07,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 03:13:07,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27164200] [2024-10-11 03:13:07,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:07,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:13:07,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:07,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:13:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:07,927 INFO L87 Difference]: Start difference. First operand 6353 states and 9536 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:13:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:08,653 INFO L93 Difference]: Finished difference Result 18878 states and 28530 transitions. [2024-10-11 03:13:08,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:13:08,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2024-10-11 03:13:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:08,737 INFO L225 Difference]: With dead ends: 18878 [2024-10-11 03:13:08,738 INFO L226 Difference]: Without dead ends: 12535 [2024-10-11 03:13:08,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:08,764 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 175 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:08,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 386 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:13:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12535 states. [2024-10-11 03:13:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12535 to 12479. [2024-10-11 03:13:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12479 states, 10680 states have (on average 1.5010299625468164) internal successors, (16031), 10814 states have internal predecessors, (16031), 1078 states have call successors, (1078), 625 states have call predecessors, (1078), 720 states have return successors, (1531), 1055 states have call predecessors, (1531), 1076 states have call successors, (1531) [2024-10-11 03:13:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12479 states to 12479 states and 18640 transitions. [2024-10-11 03:13:09,566 INFO L78 Accepts]: Start accepts. Automaton has 12479 states and 18640 transitions. Word has length 115 [2024-10-11 03:13:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:09,567 INFO L471 AbstractCegarLoop]: Abstraction has 12479 states and 18640 transitions. [2024-10-11 03:13:09,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:13:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 12479 states and 18640 transitions. [2024-10-11 03:13:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 03:13:09,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:09,585 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:13:09,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:13:09,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:09,790 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:09,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:09,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1918343391, now seen corresponding path program 1 times [2024-10-11 03:13:09,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:09,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206259333] [2024-10-11 03:13:09,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:09,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:09,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:09,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:09,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:09,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:09,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:09,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:09,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 03:13:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:13:09,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:09,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206259333] [2024-10-11 03:13:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206259333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:13:09,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595588438] [2024-10-11 03:13:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:09,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:09,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:09,931 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:13:09,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:13:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:10,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:13:10,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:13:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 03:13:10,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:13:10,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595588438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:10,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:13:10,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 03:13:10,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582641581] [2024-10-11 03:13:10,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:10,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:13:10,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:10,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:13:10,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:10,035 INFO L87 Difference]: Start difference. First operand 12479 states and 18640 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:13:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:11,556 INFO L93 Difference]: Finished difference Result 36706 states and 55427 transitions. [2024-10-11 03:13:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:13:11,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2024-10-11 03:13:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:11,629 INFO L225 Difference]: With dead ends: 36706 [2024-10-11 03:13:11,629 INFO L226 Difference]: Without dead ends: 24238 [2024-10-11 03:13:11,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:11,656 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 180 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:11,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 580 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:13:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24238 states. [2024-10-11 03:13:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24238 to 24238. [2024-10-11 03:13:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24238 states, 20716 states have (on average 1.4893319173585635) internal successors, (30853), 20947 states have internal predecessors, (30853), 2081 states have call successors, (2081), 1249 states have call predecessors, (2081), 1440 states have return successors, (3366), 2073 states have call predecessors, (3366), 2079 states have call successors, (3366) [2024-10-11 03:13:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24238 states to 24238 states and 36300 transitions. [2024-10-11 03:13:12,892 INFO L78 Accepts]: Start accepts. Automaton has 24238 states and 36300 transitions. Word has length 115 [2024-10-11 03:13:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:12,893 INFO L471 AbstractCegarLoop]: Abstraction has 24238 states and 36300 transitions. [2024-10-11 03:13:12,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:13:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 24238 states and 36300 transitions. [2024-10-11 03:13:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 03:13:12,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:12,949 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:13:12,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:13:13,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:13,151 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:13,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:13,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1510094502, now seen corresponding path program 1 times [2024-10-11 03:13:13,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:13,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627680157] [2024-10-11 03:13:13,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:13,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:13,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:13,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:13,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:13,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:13,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:13,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:13,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 03:13:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:13,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:13,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 03:13:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 03:13:13,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:13,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627680157] [2024-10-11 03:13:13,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627680157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:13:13,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172807759] [2024-10-11 03:13:13,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:13,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:13,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:13,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:13:13,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:13:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:13,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:13:13,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:13:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 03:13:13,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:13:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172807759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:13,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:13:13,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 03:13:13,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275989111] [2024-10-11 03:13:13,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:13,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:13:13,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:13,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:13:13,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:13,457 INFO L87 Difference]: Start difference. First operand 24238 states and 36300 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 03:13:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:16,317 INFO L93 Difference]: Finished difference Result 71626 states and 107943 transitions. [2024-10-11 03:13:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:13:16,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 148 [2024-10-11 03:13:16,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:16,460 INFO L225 Difference]: With dead ends: 71626 [2024-10-11 03:13:16,460 INFO L226 Difference]: Without dead ends: 47404 [2024-10-11 03:13:16,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:16,510 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 134 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:16,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 389 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:13:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47404 states. [2024-10-11 03:13:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47404 to 47192. [2024-10-11 03:13:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47192 states, 40514 states have (on average 1.4848941106777904) internal successors, (60159), 40973 states have internal predecessors, (60159), 3871 states have call successors, (3871), 2423 states have call predecessors, (3871), 2806 states have return successors, (6252), 3827 states have call predecessors, (6252), 3869 states have call successors, (6252) [2024-10-11 03:13:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47192 states to 47192 states and 70282 transitions. [2024-10-11 03:13:19,491 INFO L78 Accepts]: Start accepts. Automaton has 47192 states and 70282 transitions. Word has length 148 [2024-10-11 03:13:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:19,491 INFO L471 AbstractCegarLoop]: Abstraction has 47192 states and 70282 transitions. [2024-10-11 03:13:19,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 03:13:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 47192 states and 70282 transitions. [2024-10-11 03:13:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 03:13:19,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:19,645 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:13:19,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:13:19,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 03:13:19,847 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:19,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash 268487049, now seen corresponding path program 1 times [2024-10-11 03:13:19,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:19,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410018834] [2024-10-11 03:13:19,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:19,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 03:13:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 03:13:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 03:13:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 03:13:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 03:13:20,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:20,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410018834] [2024-10-11 03:13:20,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410018834] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:13:20,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697246831] [2024-10-11 03:13:20,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:20,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:20,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:20,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:13:20,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:13:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:20,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:13:20,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:13:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 03:13:20,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:13:20,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697246831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:20,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:13:20,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 03:13:20,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770209296] [2024-10-11 03:13:20,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:20,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:13:20,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:20,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:13:20,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:20,280 INFO L87 Difference]: Start difference. First operand 47192 states and 70282 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 03:13:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:22,357 INFO L93 Difference]: Finished difference Result 74558 states and 111677 transitions. [2024-10-11 03:13:22,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:13:22,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 165 [2024-10-11 03:13:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:22,502 INFO L225 Difference]: With dead ends: 74558 [2024-10-11 03:13:22,503 INFO L226 Difference]: Without dead ends: 41292 [2024-10-11 03:13:22,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:22,565 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 153 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:22,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 235 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:13:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41292 states. [2024-10-11 03:13:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41292 to 30100. [2024-10-11 03:13:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30100 states, 25886 states have (on average 1.4379587421772386) internal successors, (37223), 26125 states have internal predecessors, (37223), 2411 states have call successors, (2411), 1611 states have call predecessors, (2411), 1802 states have return successors, (3422), 2379 states have call predecessors, (3422), 2409 states have call successors, (3422) [2024-10-11 03:13:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30100 states to 30100 states and 43056 transitions. [2024-10-11 03:13:24,894 INFO L78 Accepts]: Start accepts. Automaton has 30100 states and 43056 transitions. Word has length 165 [2024-10-11 03:13:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:24,894 INFO L471 AbstractCegarLoop]: Abstraction has 30100 states and 43056 transitions. [2024-10-11 03:13:24,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 03:13:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 30100 states and 43056 transitions. [2024-10-11 03:13:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 03:13:24,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:24,939 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:13:24,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 03:13:25,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 03:13:25,141 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:25,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:25,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1834374216, now seen corresponding path program 1 times [2024-10-11 03:13:25,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:25,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280179573] [2024-10-11 03:13:25,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:25,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 03:13:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 03:13:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 03:13:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 03:13:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-11 03:13:25,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:25,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280179573] [2024-10-11 03:13:25,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280179573] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:13:25,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801889800] [2024-10-11 03:13:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:25,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:25,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:25,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:13:25,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:13:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:25,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 03:13:25,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:13:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 03:13:25,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:13:25,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801889800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:25,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:13:25,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 03:13:25,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071125605] [2024-10-11 03:13:25,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:25,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:13:25,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:25,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:13:25,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:25,411 INFO L87 Difference]: Start difference. First operand 30100 states and 43056 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 03:13:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:27,614 INFO L93 Difference]: Finished difference Result 63392 states and 91655 transitions. [2024-10-11 03:13:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:13:27,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 165 [2024-10-11 03:13:27,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:27,736 INFO L225 Difference]: With dead ends: 63392 [2024-10-11 03:13:27,736 INFO L226 Difference]: Without dead ends: 33310 [2024-10-11 03:13:27,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:27,795 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 173 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 236 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-11 03:13:27,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 236 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:13:27,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33310 states. [2024-10-11 03:13:30,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33310 to 33218. [2024-10-11 03:13:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33218 states, 28752 states have (on average 1.4055717863105175) internal successors, (40413), 28991 states have internal predecessors, (40413), 2477 states have call successors, (2477), 1797 states have call predecessors, (2477), 1988 states have return successors, (3666), 2445 states have call predecessors, (3666), 2475 states have call successors, (3666) [2024-10-11 03:13:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33218 states to 33218 states and 46556 transitions. [2024-10-11 03:13:30,297 INFO L78 Accepts]: Start accepts. Automaton has 33218 states and 46556 transitions. Word has length 165 [2024-10-11 03:13:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:30,298 INFO L471 AbstractCegarLoop]: Abstraction has 33218 states and 46556 transitions. [2024-10-11 03:13:30,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 03:13:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 33218 states and 46556 transitions. [2024-10-11 03:13:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 03:13:30,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:30,343 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:13:30,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 03:13:30,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 03:13:30,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:30,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1899656566, now seen corresponding path program 1 times [2024-10-11 03:13:30,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:30,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693028950] [2024-10-11 03:13:30,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:30,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 03:13:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 03:13:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 03:13:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 03:13:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-11 03:13:30,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693028950] [2024-10-11 03:13:30,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693028950] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:13:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128600534] [2024-10-11 03:13:30,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:30,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:30,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:30,646 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:13:30,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:13:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 03:13:30,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:13:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 03:13:30,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:13:30,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128600534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:30,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:13:30,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 03:13:30,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607254817] [2024-10-11 03:13:30,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:30,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:13:30,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:30,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:13:30,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:30,778 INFO L87 Difference]: Start difference. First operand 33218 states and 46556 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 03:13:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:32,891 INFO L93 Difference]: Finished difference Result 58283 states and 81492 transitions. [2024-10-11 03:13:32,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:13:32,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 165 [2024-10-11 03:13:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:33,026 INFO L225 Difference]: With dead ends: 58283 [2024-10-11 03:13:33,027 INFO L226 Difference]: Without dead ends: 35214 [2024-10-11 03:13:33,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:33,074 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 145 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:33,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 430 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:13:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35214 states. [2024-10-11 03:13:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35214 to 35066. [2024-10-11 03:13:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35066 states, 30448 states have (on average 1.383243562795586) internal successors, (42117), 30687 states have internal predecessors, (42117), 2505 states have call successors, (2505), 1913 states have call predecessors, (2505), 2112 states have return successors, (3818), 2481 states have call predecessors, (3818), 2503 states have call successors, (3818) [2024-10-11 03:13:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35066 states to 35066 states and 48440 transitions. [2024-10-11 03:13:35,551 INFO L78 Accepts]: Start accepts. Automaton has 35066 states and 48440 transitions. Word has length 165 [2024-10-11 03:13:35,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:35,551 INFO L471 AbstractCegarLoop]: Abstraction has 35066 states and 48440 transitions. [2024-10-11 03:13:35,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 03:13:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 35066 states and 48440 transitions. [2024-10-11 03:13:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:13:35,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:35,600 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:13:35,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 03:13:35,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:35,805 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:35,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash 934781307, now seen corresponding path program 1 times [2024-10-11 03:13:35,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:35,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401055828] [2024-10-11 03:13:35,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:35,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:13:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:13:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:13:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:13:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:13:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:13:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 03:13:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 03:13:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-11 03:13:35,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:35,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401055828] [2024-10-11 03:13:35,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401055828] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:13:35,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741411627] [2024-10-11 03:13:35,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:35,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:35,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:35,906 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:13:35,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 03:13:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:13:35,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:13:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 03:13:36,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:13:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741411627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:36,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:13:36,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 03:13:36,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508861868] [2024-10-11 03:13:36,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:36,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:13:36,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:36,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:13:36,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:36,023 INFO L87 Difference]: Start difference. First operand 35066 states and 48440 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)