./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87df5a94129a3baa1e2e3650ee6bffcda9607641da2006311f5769f81726e25d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:57:24,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:57:25,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:57:25,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:57:25,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:57:25,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:57:25,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:57:25,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:57:25,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:57:25,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:57:25,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:57:25,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:57:25,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:57:25,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:57:25,041 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:57:25,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:57:25,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:57:25,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:57:25,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:57:25,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:57:25,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:57:25,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:57:25,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:57:25,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:57:25,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:57:25,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:57:25,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:57:25,048 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:57:25,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:57:25,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:57:25,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:57:25,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:57:25,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:57:25,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:57:25,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:57:25,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:57:25,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:57:25,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:57:25,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:57:25,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:57:25,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:57:25,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:57:25,053 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87df5a94129a3baa1e2e3650ee6bffcda9607641da2006311f5769f81726e25d [2024-10-12 20:57:25,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:57:25,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:57:25,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:57:25,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:57:25,311 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:57:25,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c [2024-10-12 20:57:26,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:57:27,121 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:57:27,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c [2024-10-12 20:57:27,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15adde86f/914177bf91944511a44b5beda0300edc/FLAGe3f9a77c7 [2024-10-12 20:57:27,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15adde86f/914177bf91944511a44b5beda0300edc [2024-10-12 20:57:27,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:57:27,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:57:27,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:57:27,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:57:27,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:57:27,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:57:27" (1/1) ... [2024-10-12 20:57:27,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef56591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:27, skipping insertion in model container [2024-10-12 20:57:27,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:57:27" (1/1) ... [2024-10-12 20:57:27,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:57:28,568 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/combinations/Problem05_label43+token_ring.10.cil-2.c[381679,381692] [2024-10-12 20:57:28,589 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/combinations/Problem05_label43+token_ring.10.cil-2.c[383339,383352] [2024-10-12 20:57:28,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:57:28,796 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:57:29,368 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/combinations/Problem05_label43+token_ring.10.cil-2.c[381679,381692] [2024-10-12 20:57:29,373 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/combinations/Problem05_label43+token_ring.10.cil-2.c[383339,383352] [2024-10-12 20:57:29,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:57:29,455 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:57:29,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29 WrapperNode [2024-10-12 20:57:29,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:57:29,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:57:29,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:57:29,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:57:29,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (1/1) ... [2024-10-12 20:57:29,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (1/1) ... [2024-10-12 20:57:29,821 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13113 [2024-10-12 20:57:29,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:57:29,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:57:29,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:57:29,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:57:29,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (1/1) ... [2024-10-12 20:57:29,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (1/1) ... [2024-10-12 20:57:29,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (1/1) ... [2024-10-12 20:57:29,972 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-12 20:57:29,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (1/1) ... [2024-10-12 20:57:29,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (1/1) ... [2024-10-12 20:57:30,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (1/1) ... [2024-10-12 20:57:30,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (1/1) ... [2024-10-12 20:57:30,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (1/1) ... [2024-10-12 20:57:30,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (1/1) ... [2024-10-12 20:57:30,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:57:30,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:57:30,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:57:30,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:57:30,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (1/1) ... [2024-10-12 20:57:30,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:57:30,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:57:30,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:57:30,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:57:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:57:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:57:30,514 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:57:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:57:30,515 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:57:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:57:30,515 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:57:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:57:30,515 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:57:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:57:30,515 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:57:30,519 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:57:30,520 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:57:30,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:57:30,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:57:30,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:57:30,683 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:57:30,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:57:36,899 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2024-10-12 20:57:36,899 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:57:36,975 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:57:36,975 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-12 20:57:36,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:57:36 BoogieIcfgContainer [2024-10-12 20:57:36,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:57:36,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:57:36,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:57:36,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:57:36,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:57:27" (1/3) ... [2024-10-12 20:57:36,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f729c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:57:36, skipping insertion in model container [2024-10-12 20:57:36,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:29" (2/3) ... [2024-10-12 20:57:36,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f729c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:57:36, skipping insertion in model container [2024-10-12 20:57:36,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:57:36" (3/3) ... [2024-10-12 20:57:36,983 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.10.cil-2.c [2024-10-12 20:57:36,996 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:57:36,996 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:57:37,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:57:37,105 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;@22935ae3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:57:37,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:57:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 2425 states, 2392 states have (on average 1.8775083612040133) internal successors, (4491), 2395 states have internal predecessors, (4491), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 20:57:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:57:37,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:37,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:57:37,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:37,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:37,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1836165759, now seen corresponding path program 1 times [2024-10-12 20:57:37,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:37,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176994874] [2024-10-12 20:57:37,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:37,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:37,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:37,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:57:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:37,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:57:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:57:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:37,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:57:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:37,663 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-12 20:57:37,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:37,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176994874] [2024-10-12 20:57:37,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176994874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:37,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:37,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:57:37,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315292579] [2024-10-12 20:57:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:37,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:57:37,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:37,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:57:37,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:57:37,701 INFO L87 Difference]: Start difference. First operand has 2425 states, 2392 states have (on average 1.8775083612040133) internal successors, (4491), 2395 states have internal predecessors, (4491), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:39,247 INFO L93 Difference]: Finished difference Result 4952 states and 9258 transitions. [2024-10-12 20:57:39,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:57:39,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:57:39,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:39,279 INFO L225 Difference]: With dead ends: 4952 [2024-10-12 20:57:39,279 INFO L226 Difference]: Without dead ends: 2531 [2024-10-12 20:57:39,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:57:39,292 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 837 mSDsluCounter, 12160 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 16379 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:39,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 16379 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:57:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2024-10-12 20:57:39,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2421. [2024-10-12 20:57:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2389 states have (on average 1.8396818752616158) internal successors, (4395), 2391 states have internal predecessors, (4395), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 20:57:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4443 transitions. [2024-10-12 20:57:39,417 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4443 transitions. Word has length 141 [2024-10-12 20:57:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:39,417 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 4443 transitions. [2024-10-12 20:57:39,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4443 transitions. [2024-10-12 20:57:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:57:39,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:39,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:57:39,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:57:39,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:39,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1161005633, now seen corresponding path program 1 times [2024-10-12 20:57:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:39,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043029338] [2024-10-12 20:57:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:39,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:39,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:57:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:39,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:57:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:39,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:57:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:39,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:57:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:39,761 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-12 20:57:39,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:39,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043029338] [2024-10-12 20:57:39,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043029338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:39,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:39,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467659758] [2024-10-12 20:57:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:39,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:39,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:39,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:39,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:39,766 INFO L87 Difference]: Start difference. First operand 2421 states and 4443 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:43,124 INFO L93 Difference]: Finished difference Result 3245 states and 5826 transitions. [2024-10-12 20:57:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:57:43,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:57:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:43,137 INFO L225 Difference]: With dead ends: 3245 [2024-10-12 20:57:43,138 INFO L226 Difference]: Without dead ends: 2961 [2024-10-12 20:57:43,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:57:43,142 INFO L432 NwaCegarLoop]: 4363 mSDtfsCounter, 5163 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5180 SdHoareTripleChecker+Valid, 21516 SdHoareTripleChecker+Invalid, 3364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:43,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5180 Valid, 21516 Invalid, 3364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 20:57:43,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2024-10-12 20:57:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2724. [2024-10-12 20:57:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2663 states have (on average 1.819752159218926) internal successors, (4846), 2667 states have internal predecessors, (4846), 45 states have call successors, (45), 12 states have call predecessors, (45), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2024-10-12 20:57:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 4943 transitions. [2024-10-12 20:57:43,238 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 4943 transitions. Word has length 141 [2024-10-12 20:57:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:43,240 INFO L471 AbstractCegarLoop]: Abstraction has 2724 states and 4943 transitions. [2024-10-12 20:57:43,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 4943 transitions. [2024-10-12 20:57:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:57:43,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:43,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:57:43,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:57:43,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:43,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1649052739, now seen corresponding path program 1 times [2024-10-12 20:57:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:43,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409808478] [2024-10-12 20:57:43,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:43,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:57:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:57:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:57:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:57:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,527 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-12 20:57:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409808478] [2024-10-12 20:57:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409808478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:43,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:43,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:43,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384731180] [2024-10-12 20:57:43,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:43,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:43,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:43,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:43,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:43,532 INFO L87 Difference]: Start difference. First operand 2724 states and 4943 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:46,189 INFO L93 Difference]: Finished difference Result 4288 states and 7546 transitions. [2024-10-12 20:57:46,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:57:46,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:57:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:46,202 INFO L225 Difference]: With dead ends: 4288 [2024-10-12 20:57:46,202 INFO L226 Difference]: Without dead ends: 3703 [2024-10-12 20:57:46,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:57:46,206 INFO L432 NwaCegarLoop]: 4311 mSDtfsCounter, 5204 mSDsluCounter, 17089 mSDsCounter, 0 mSdLazyCounter, 2989 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5221 SdHoareTripleChecker+Valid, 21400 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:46,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5221 Valid, 21400 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2989 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 20:57:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3703 states. [2024-10-12 20:57:46,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3703 to 3278. [2024-10-12 20:57:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7873617693522907) internal successors, (5657), 3171 states have internal predecessors, (5657), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-12 20:57:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5840 transitions. [2024-10-12 20:57:46,288 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5840 transitions. Word has length 141 [2024-10-12 20:57:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:46,288 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5840 transitions. [2024-10-12 20:57:46,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5840 transitions. [2024-10-12 20:57:46,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:57:46,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:46,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:57:46,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:57:46,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:46,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:46,291 INFO L85 PathProgramCache]: Analyzing trace with hash 556417537, now seen corresponding path program 1 times [2024-10-12 20:57:46,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:46,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568258055] [2024-10-12 20:57:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:46,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:46,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:57:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:46,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:57:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:57:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:46,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:57:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:46,504 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-12 20:57:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568258055] [2024-10-12 20:57:46,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568258055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:46,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:46,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:46,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094590687] [2024-10-12 20:57:46,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:46,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:46,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:46,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:46,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:46,507 INFO L87 Difference]: Start difference. First operand 3278 states and 5840 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:47,819 INFO L93 Difference]: Finished difference Result 4857 states and 8484 transitions. [2024-10-12 20:57:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:47,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:57:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:47,832 INFO L225 Difference]: With dead ends: 4857 [2024-10-12 20:57:47,832 INFO L226 Difference]: Without dead ends: 3716 [2024-10-12 20:57:47,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:57:47,837 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 5000 mSDsluCounter, 12398 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5018 SdHoareTripleChecker+Valid, 16573 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:47,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5018 Valid, 16573 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:57:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2024-10-12 20:57:47,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3278. [2024-10-12 20:57:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.785781990521327) internal successors, (5652), 3171 states have internal predecessors, (5652), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-12 20:57:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5835 transitions. [2024-10-12 20:57:47,948 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5835 transitions. Word has length 141 [2024-10-12 20:57:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:47,952 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5835 transitions. [2024-10-12 20:57:47,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5835 transitions. [2024-10-12 20:57:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:57:47,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:47,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:57:47,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:57:47,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:47,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:47,954 INFO L85 PathProgramCache]: Analyzing trace with hash -725754749, now seen corresponding path program 1 times [2024-10-12 20:57:47,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:47,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231330030] [2024-10-12 20:57:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:47,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:57:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:57:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:57:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:57:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,202 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-12 20:57:48,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:48,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231330030] [2024-10-12 20:57:48,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231330030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:48,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:48,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:48,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006982914] [2024-10-12 20:57:48,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:48,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:48,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:48,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:48,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:48,205 INFO L87 Difference]: Start difference. First operand 3278 states and 5835 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:49,335 INFO L93 Difference]: Finished difference Result 4853 states and 8463 transitions. [2024-10-12 20:57:49,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:49,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:57:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:49,349 INFO L225 Difference]: With dead ends: 4853 [2024-10-12 20:57:49,349 INFO L226 Difference]: Without dead ends: 3712 [2024-10-12 20:57:49,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:57:49,354 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4998 mSDsluCounter, 12398 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5016 SdHoareTripleChecker+Valid, 16573 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:49,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5016 Valid, 16573 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:57:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2024-10-12 20:57:49,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3278. [2024-10-12 20:57:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7842022116903633) internal successors, (5647), 3171 states have internal predecessors, (5647), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-12 20:57:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5830 transitions. [2024-10-12 20:57:49,444 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5830 transitions. Word has length 141 [2024-10-12 20:57:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:49,444 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5830 transitions. [2024-10-12 20:57:49,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5830 transitions. [2024-10-12 20:57:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:57:49,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:49,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:57:49,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:57:49,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:49,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:49,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1726736833, now seen corresponding path program 1 times [2024-10-12 20:57:49,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:49,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159465746] [2024-10-12 20:57:49,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:49,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:49,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:49,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:57:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:49,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:57:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:49,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:57:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:49,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:57:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:49,648 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-12 20:57:49,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:49,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159465746] [2024-10-12 20:57:49,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159465746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:49,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:49,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:49,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536428349] [2024-10-12 20:57:49,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:49,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:49,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:49,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:49,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:49,652 INFO L87 Difference]: Start difference. First operand 3278 states and 5830 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:50,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:50,982 INFO L93 Difference]: Finished difference Result 4848 states and 8440 transitions. [2024-10-12 20:57:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:50,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:57:50,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:50,994 INFO L225 Difference]: With dead ends: 4848 [2024-10-12 20:57:50,995 INFO L226 Difference]: Without dead ends: 3707 [2024-10-12 20:57:50,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:57:50,999 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4867 mSDsluCounter, 16496 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4885 SdHoareTripleChecker+Valid, 20671 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:50,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4885 Valid, 20671 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:57:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2024-10-12 20:57:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3278. [2024-10-12 20:57:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7826224328593996) internal successors, (5642), 3171 states have internal predecessors, (5642), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-12 20:57:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5825 transitions. [2024-10-12 20:57:51,089 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5825 transitions. Word has length 141 [2024-10-12 20:57:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:51,090 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5825 transitions. [2024-10-12 20:57:51,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5825 transitions. [2024-10-12 20:57:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:57:51,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:51,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:57:51,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:57:51,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:51,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:51,099 INFO L85 PathProgramCache]: Analyzing trace with hash 4734147, now seen corresponding path program 1 times [2024-10-12 20:57:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:51,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46023195] [2024-10-12 20:57:51,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:51,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:51,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:51,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:57:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:51,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:57:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:51,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:57:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:51,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:57:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:51,288 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-12 20:57:51,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:51,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46023195] [2024-10-12 20:57:51,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46023195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:51,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:51,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:51,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846358067] [2024-10-12 20:57:51,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:51,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:51,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:51,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:51,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:51,291 INFO L87 Difference]: Start difference. First operand 3278 states and 5825 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:54,113 INFO L93 Difference]: Finished difference Result 6307 states and 10801 transitions. [2024-10-12 20:57:54,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:57:54,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:57:54,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:54,132 INFO L225 Difference]: With dead ends: 6307 [2024-10-12 20:57:54,132 INFO L226 Difference]: Without dead ends: 5168 [2024-10-12 20:57:54,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:57:54,138 INFO L432 NwaCegarLoop]: 4358 mSDtfsCounter, 5154 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3198 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5171 SdHoareTripleChecker+Valid, 21511 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:54,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5171 Valid, 21511 Invalid, 3262 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 3198 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 20:57:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2024-10-12 20:57:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 4397. [2024-10-12 20:57:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 4180 states have (on average 1.7375598086124402) internal successors, (7263), 4190 states have internal predecessors, (7263), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-12 20:57:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 7624 transitions. [2024-10-12 20:57:54,356 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 7624 transitions. Word has length 141 [2024-10-12 20:57:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:54,357 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 7624 transitions. [2024-10-12 20:57:54,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 7624 transitions. [2024-10-12 20:57:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:57:54,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:54,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:57:54,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:57:54,361 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:54,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:54,361 INFO L85 PathProgramCache]: Analyzing trace with hash -327908991, now seen corresponding path program 1 times [2024-10-12 20:57:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:54,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939976587] [2024-10-12 20:57:54,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:54,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:54,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:57:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:54,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:57:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:54,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:57:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:54,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:57:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:54,597 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-12 20:57:54,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:54,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939976587] [2024-10-12 20:57:54,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939976587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:54,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:54,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:54,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663160018] [2024-10-12 20:57:54,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:54,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:54,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:54,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:54,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:54,600 INFO L87 Difference]: Start difference. First operand 4397 states and 7624 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:56,163 INFO L93 Difference]: Finished difference Result 7464 states and 12699 transitions. [2024-10-12 20:57:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:56,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:57:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:56,182 INFO L225 Difference]: With dead ends: 7464 [2024-10-12 20:57:56,182 INFO L226 Difference]: Without dead ends: 5204 [2024-10-12 20:57:56,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:57:56,191 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4871 mSDsluCounter, 16496 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4889 SdHoareTripleChecker+Valid, 20671 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:56,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4889 Valid, 20671 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:57:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2024-10-12 20:57:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4397. [2024-10-12 20:57:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 4180 states have (on average 1.7354066985645933) internal successors, (7254), 4190 states have internal predecessors, (7254), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-12 20:57:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 7615 transitions. [2024-10-12 20:57:56,351 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 7615 transitions. Word has length 141 [2024-10-12 20:57:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:56,351 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 7615 transitions. [2024-10-12 20:57:56,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:56,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 7615 transitions. [2024-10-12 20:57:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:57:56,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:56,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:57:56,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:57:56,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:56,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:56,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1601023235, now seen corresponding path program 1 times [2024-10-12 20:57:56,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:56,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682824030] [2024-10-12 20:57:56,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:56,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:57:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:57:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:57:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:57:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,543 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-12 20:57:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:56,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682824030] [2024-10-12 20:57:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682824030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:56,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303951109] [2024-10-12 20:57:56,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:56,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:56,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:56,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:56,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:56,545 INFO L87 Difference]: Start difference. First operand 4397 states and 7615 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:59,130 INFO L93 Difference]: Finished difference Result 10354 states and 17366 transitions. [2024-10-12 20:57:59,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:57:59,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:57:59,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:59,149 INFO L225 Difference]: With dead ends: 10354 [2024-10-12 20:57:59,149 INFO L226 Difference]: Without dead ends: 8096 [2024-10-12 20:57:59,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:57:59,157 INFO L432 NwaCegarLoop]: 4358 mSDtfsCounter, 5186 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3078 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5203 SdHoareTripleChecker+Valid, 21511 SdHoareTripleChecker+Invalid, 3142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:59,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5203 Valid, 21511 Invalid, 3142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3078 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:57:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2024-10-12 20:57:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6657. [2024-10-12 20:57:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 6232 states have (on average 1.6882220795892169) internal successors, (10521), 6250 states have internal predecessors, (10521), 311 states have call successors, (311), 96 states have call predecessors, (311), 112 states have return successors, (424), 326 states have call predecessors, (424), 311 states have call successors, (424) [2024-10-12 20:57:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 11256 transitions. [2024-10-12 20:57:59,392 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 11256 transitions. Word has length 141 [2024-10-12 20:57:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:59,392 INFO L471 AbstractCegarLoop]: Abstraction has 6657 states and 11256 transitions. [2024-10-12 20:57:59,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 11256 transitions. [2024-10-12 20:57:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:57:59,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:59,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:57:59,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:57:59,397 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:59,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:59,397 INFO L85 PathProgramCache]: Analyzing trace with hash -966799099, now seen corresponding path program 1 times [2024-10-12 20:57:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:59,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335745047] [2024-10-12 20:57:59,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:59,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:59,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:59,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:57:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:59,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:57:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:59,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:57:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:59,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:57:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:59,574 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-12 20:57:59,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:59,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335745047] [2024-10-12 20:57:59,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335745047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:59,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:59,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:59,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472302480] [2024-10-12 20:57:59,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:59,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:59,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:59,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:59,576 INFO L87 Difference]: Start difference. First operand 6657 states and 11256 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:02,229 INFO L93 Difference]: Finished difference Result 18478 states and 30647 transitions. [2024-10-12 20:58:02,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:58:02,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:58:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:02,265 INFO L225 Difference]: With dead ends: 18478 [2024-10-12 20:58:02,265 INFO L226 Difference]: Without dead ends: 13960 [2024-10-12 20:58:02,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:58:02,278 INFO L432 NwaCegarLoop]: 4312 mSDtfsCounter, 5212 mSDsluCounter, 17089 mSDsCounter, 0 mSdLazyCounter, 2832 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5229 SdHoareTripleChecker+Valid, 21401 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:02,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5229 Valid, 21401 Invalid, 2902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2832 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:58:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13960 states. [2024-10-12 20:58:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13960 to 11193. [2024-10-12 20:58:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11193 states, 10352 states have (on average 1.6498261205564142) internal successors, (17079), 10386 states have internal predecessors, (17079), 615 states have call successors, (615), 192 states have call predecessors, (615), 224 states have return successors, (922), 646 states have call predecessors, (922), 615 states have call successors, (922) [2024-10-12 20:58:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11193 states to 11193 states and 18616 transitions. [2024-10-12 20:58:02,723 INFO L78 Accepts]: Start accepts. Automaton has 11193 states and 18616 transitions. Word has length 141 [2024-10-12 20:58:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:02,724 INFO L471 AbstractCegarLoop]: Abstraction has 11193 states and 18616 transitions. [2024-10-12 20:58:02,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 11193 states and 18616 transitions. [2024-10-12 20:58:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:58:02,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:02,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:58:02,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:58:02,731 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:02,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:02,731 INFO L85 PathProgramCache]: Analyzing trace with hash -495442749, now seen corresponding path program 1 times [2024-10-12 20:58:02,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:02,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594951878] [2024-10-12 20:58:02,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:02,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:02,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:58:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:02,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:58:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:02,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:58:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:02,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:58:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:02,920 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-12 20:58:02,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594951878] [2024-10-12 20:58:02,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594951878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:02,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:02,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:02,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137850670] [2024-10-12 20:58:02,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:02,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:02,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:02,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:02,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:02,921 INFO L87 Difference]: Start difference. First operand 11193 states and 18616 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:06,823 INFO L93 Difference]: Finished difference Result 38822 states and 64027 transitions. [2024-10-12 20:58:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:58:06,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:58:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:06,917 INFO L225 Difference]: With dead ends: 38822 [2024-10-12 20:58:06,917 INFO L226 Difference]: Without dead ends: 29768 [2024-10-12 20:58:06,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:58:06,957 INFO L432 NwaCegarLoop]: 4357 mSDtfsCounter, 5552 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5580 SdHoareTripleChecker+Valid, 21505 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:06,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5580 Valid, 21505 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3047 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 20:58:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29768 states. [2024-10-12 20:58:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29768 to 20233. [2024-10-12 20:58:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20233 states, 18592 states have (on average 1.6249462134251291) internal successors, (30211), 18658 states have internal predecessors, (30211), 1191 states have call successors, (1191), 384 states have call predecessors, (1191), 448 states have return successors, (2048), 1254 states have call predecessors, (2048), 1191 states have call successors, (2048) [2024-10-12 20:58:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20233 states to 20233 states and 33450 transitions. [2024-10-12 20:58:08,085 INFO L78 Accepts]: Start accepts. Automaton has 20233 states and 33450 transitions. Word has length 141 [2024-10-12 20:58:08,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:08,086 INFO L471 AbstractCegarLoop]: Abstraction has 20233 states and 33450 transitions. [2024-10-12 20:58:08,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 20233 states and 33450 transitions. [2024-10-12 20:58:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:58:08,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:08,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:58:08,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:58:08,097 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:08,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2142805691, now seen corresponding path program 1 times [2024-10-12 20:58:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045113045] [2024-10-12 20:58:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:08,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:08,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:08,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:58:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:58:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:08,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:58:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:08,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:58:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:08,265 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-12 20:58:08,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:08,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045113045] [2024-10-12 20:58:08,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045113045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:08,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:08,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:08,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677832546] [2024-10-12 20:58:08,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:08,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:08,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:08,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:08,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:08,267 INFO L87 Difference]: Start difference. First operand 20233 states and 33450 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:13,567 INFO L93 Difference]: Finished difference Result 74518 states and 123319 transitions. [2024-10-12 20:58:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:58:13,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:58:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:13,751 INFO L225 Difference]: With dead ends: 74518 [2024-10-12 20:58:13,751 INFO L226 Difference]: Without dead ends: 56424 [2024-10-12 20:58:13,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:58:13,800 INFO L432 NwaCegarLoop]: 4354 mSDtfsCounter, 5271 mSDsluCounter, 17145 mSDsCounter, 0 mSdLazyCounter, 3588 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 21499 SdHoareTripleChecker+Invalid, 3654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:13,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5287 Valid, 21499 Invalid, 3654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3588 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 20:58:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56424 states. [2024-10-12 20:58:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56424 to 37993. [2024-10-12 20:58:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37993 states, 34784 states have (on average 1.610711821527139) internal successors, (56027), 34914 states have internal predecessors, (56027), 2311 states have call successors, (2311), 768 states have call predecessors, (2311), 896 states have return successors, (4754), 2438 states have call predecessors, (4754), 2311 states have call successors, (4754) [2024-10-12 20:58:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37993 states to 37993 states and 63092 transitions. [2024-10-12 20:58:15,992 INFO L78 Accepts]: Start accepts. Automaton has 37993 states and 63092 transitions. Word has length 141 [2024-10-12 20:58:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:15,993 INFO L471 AbstractCegarLoop]: Abstraction has 37993 states and 63092 transitions. [2024-10-12 20:58:15,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 37993 states and 63092 transitions. [2024-10-12 20:58:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:58:16,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:16,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:58:16,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:58:16,014 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:16,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:16,014 INFO L85 PathProgramCache]: Analyzing trace with hash 20810883, now seen corresponding path program 1 times [2024-10-12 20:58:16,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:16,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392663901] [2024-10-12 20:58:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:16,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:16,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:16,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:58:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:16,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:58:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:16,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:58:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:16,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:58:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:16,175 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-12 20:58:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392663901] [2024-10-12 20:58:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392663901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:16,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:16,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:16,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593250313] [2024-10-12 20:58:16,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:16,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:16,177 INFO L87 Difference]: Start difference. First operand 37993 states and 63092 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:23,706 INFO L93 Difference]: Finished difference Result 144054 states and 240647 transitions. [2024-10-12 20:58:23,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:58:23,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:58:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:24,169 INFO L225 Difference]: With dead ends: 144054 [2024-10-12 20:58:24,169 INFO L226 Difference]: Without dead ends: 108200 [2024-10-12 20:58:24,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:58:24,278 INFO L432 NwaCegarLoop]: 4357 mSDtfsCounter, 5484 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 3021 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5512 SdHoareTripleChecker+Valid, 21505 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:24,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5512 Valid, 21505 Invalid, 3088 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3021 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 20:58:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108200 states. [2024-10-12 20:58:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108200 to 73833. [2024-10-12 20:58:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73833 states, 67552 states have (on average 1.6031945760303175) internal successors, (108299), 67810 states have internal predecessors, (108299), 4487 states have call successors, (4487), 1536 states have call predecessors, (4487), 1792 states have return successors, (11560), 4742 states have call predecessors, (11560), 4487 states have call successors, (11560) [2024-10-12 20:58:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73833 states to 73833 states and 124346 transitions. [2024-10-12 20:58:29,453 INFO L78 Accepts]: Start accepts. Automaton has 73833 states and 124346 transitions. Word has length 141 [2024-10-12 20:58:29,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:29,454 INFO L471 AbstractCegarLoop]: Abstraction has 73833 states and 124346 transitions. [2024-10-12 20:58:29,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 73833 states and 124346 transitions. [2024-10-12 20:58:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 20:58:29,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:29,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:58:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:58:29,492 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:29,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1017773691, now seen corresponding path program 1 times [2024-10-12 20:58:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423477023] [2024-10-12 20:58:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:29,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:29,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:58:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:29,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:58:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:29,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:58:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:29,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:58:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:29,662 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-12 20:58:29,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:29,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423477023] [2024-10-12 20:58:29,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423477023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:29,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:29,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:29,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545972093] [2024-10-12 20:58:29,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:29,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:29,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:29,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:29,664 INFO L87 Difference]: Start difference. First operand 73833 states and 124346 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:42,869 INFO L93 Difference]: Finished difference Result 282038 states and 479215 transitions. [2024-10-12 20:58:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:58:42,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-12 20:58:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:43,922 INFO L225 Difference]: With dead ends: 282038 [2024-10-12 20:58:43,922 INFO L226 Difference]: Without dead ends: 210344 [2024-10-12 20:58:44,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:58:44,140 INFO L432 NwaCegarLoop]: 4358 mSDtfsCounter, 5450 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 3013 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5478 SdHoareTripleChecker+Valid, 21506 SdHoareTripleChecker+Invalid, 3080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:44,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5478 Valid, 21506 Invalid, 3080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3013 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]