./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_label41+token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.04.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b18a76c867b23fc238210d30f7146aaa10cc52d26bc0f62c42cd3676dc575e59 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:12:03,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:12:03,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:12:03,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:12:03,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:12:03,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:12:03,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:12:03,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:12:03,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:12:03,590 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:12:03,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:12:03,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:12:03,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:12:03,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:12:03,593 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:12:03,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:12:03,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:12:03,596 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:12:03,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:12:03,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:12:03,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:12:03,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:12:03,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:12:03,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:12:03,601 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:12:03,601 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:12:03,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:12:03,601 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:12:03,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:12:03,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:12:03,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:12:03,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:12:03,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:12:03,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:12:03,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:12:03,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:12:03,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:12:03,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:12:03,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:12:03,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:12:03,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:12:03,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:12:03,605 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b18a76c867b23fc238210d30f7146aaa10cc52d26bc0f62c42cd3676dc575e59 [2024-10-11 04:12:03,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:12:03,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:12:03,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:12:03,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:12:03,854 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:12:03,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.04.cil-1.c [2024-10-11 04:12:05,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:12:05,654 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:12:05,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.04.cil-1.c [2024-10-11 04:12:05,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3a887db04/cf4676f944d14516988969e12b847c8d/FLAGca4fec5cb [2024-10-11 04:12:05,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3a887db04/cf4676f944d14516988969e12b847c8d [2024-10-11 04:12:05,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:12:05,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:12:05,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:12:05,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:12:05,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:12:05,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:12:05" (1/1) ... [2024-10-11 04:12:05,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8bc1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:05, skipping insertion in model container [2024-10-11 04:12:05,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:12:05" (1/1) ... [2024-10-11 04:12:05,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:12:07,115 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_label41+token_ring.04.cil-1.c[376251,376264] [2024-10-11 04:12:07,142 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_label41+token_ring.04.cil-1.c[383339,383352] [2024-10-11 04:12:07,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:12:07,286 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:12:07,988 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_label41+token_ring.04.cil-1.c[376251,376264] [2024-10-11 04:12:07,997 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_label41+token_ring.04.cil-1.c[383339,383352] [2024-10-11 04:12:08,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:12:08,057 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:12:08,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08 WrapperNode [2024-10-11 04:12:08,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:12:08,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:12:08,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:12:08,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:12:08,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (1/1) ... [2024-10-11 04:12:08,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (1/1) ... [2024-10-11 04:12:08,334 INFO L138 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12753 [2024-10-11 04:12:08,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:12:08,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:12:08,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:12:08,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:12:08,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (1/1) ... [2024-10-11 04:12:08,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (1/1) ... [2024-10-11 04:12:08,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (1/1) ... [2024-10-11 04:12:08,555 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:12:08,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (1/1) ... [2024-10-11 04:12:08,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (1/1) ... [2024-10-11 04:12:08,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (1/1) ... [2024-10-11 04:12:08,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (1/1) ... [2024-10-11 04:12:08,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (1/1) ... [2024-10-11 04:12:08,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (1/1) ... [2024-10-11 04:12:08,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:12:08,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:12:08,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:12:08,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:12:08,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (1/1) ... [2024-10-11 04:12:08,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:12:08,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:12:08,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:12:09,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:12:09,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:12:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:12:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:12:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:12:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:12:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:12:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:12:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:12:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:12:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:12:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:12:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:12:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:12:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:12:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:12:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:12:09,151 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:12:09,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:12:15,120 INFO L? ?]: Removed 1707 outVars from TransFormulas that were not future-live. [2024-10-11 04:12:15,120 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:12:15,227 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:12:15,228 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-11 04:12:15,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:12:15 BoogieIcfgContainer [2024-10-11 04:12:15,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:12:15,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:12:15,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:12:15,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:12:15,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:12:05" (1/3) ... [2024-10-11 04:12:15,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3686f360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:12:15, skipping insertion in model container [2024-10-11 04:12:15,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:08" (2/3) ... [2024-10-11 04:12:15,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3686f360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:12:15, skipping insertion in model container [2024-10-11 04:12:15,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:12:15" (3/3) ... [2024-10-11 04:12:15,239 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.04.cil-1.c [2024-10-11 04:12:15,253 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:12:15,254 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:12:15,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:12:15,366 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;@49ba43b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:12:15,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:12:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 2287 states, 2260 states have (on average 1.8836283185840708) internal successors, (4257), 2263 states have internal predecessors, (4257), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 04:12:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:12:15,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:15,395 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] [2024-10-11 04:12:15,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:15,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:15,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1377940007, now seen corresponding path program 1 times [2024-10-11 04:12:15,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:15,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881035121] [2024-10-11 04:12:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:15,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:15,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:15,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:15,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:12:15,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:15,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881035121] [2024-10-11 04:12:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881035121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:15,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:15,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:12:15,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974240199] [2024-10-11 04:12:15,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:15,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:12:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:15,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:12:15,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:12:15,853 INFO L87 Difference]: Start difference. First operand has 2287 states, 2260 states have (on average 1.8836283185840708) internal successors, (4257), 2263 states have internal predecessors, (4257), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 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-11 04:12:16,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:16,752 INFO L93 Difference]: Finished difference Result 4620 states and 8666 transitions. [2024-10-11 04:12:16,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:12:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 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 81 [2024-10-11 04:12:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:16,775 INFO L225 Difference]: With dead ends: 4620 [2024-10-11 04:12:16,776 INFO L226 Difference]: Without dead ends: 2333 [2024-10-11 04:12:16,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:12:16,792 INFO L432 NwaCegarLoop]: 4105 mSDtfsCounter, 411 mSDsluCounter, 12028 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 16133 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:16,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 16133 Invalid, 486 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:12:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2024-10-11 04:12:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2283. [2024-10-11 04:12:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2257 states have (on average 1.8489144882587505) internal successors, (4173), 2259 states have internal predecessors, (4173), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 04:12:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 4209 transitions. [2024-10-11 04:12:16,911 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 4209 transitions. Word has length 81 [2024-10-11 04:12:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:16,915 INFO L471 AbstractCegarLoop]: Abstraction has 2283 states and 4209 transitions. [2024-10-11 04:12:16,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 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-11 04:12:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 4209 transitions. [2024-10-11 04:12:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:12:16,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:16,918 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] [2024-10-11 04:12:16,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:12:16,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:16,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:16,919 INFO L85 PathProgramCache]: Analyzing trace with hash 490717161, now seen corresponding path program 1 times [2024-10-11 04:12:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:16,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633068794] [2024-10-11 04:12:16,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:16,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:17,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:17,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:17,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:17,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:12:17,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:17,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633068794] [2024-10-11 04:12:17,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633068794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:17,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:17,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:12:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014848577] [2024-10-11 04:12:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:17,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:12:17,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:17,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:12:17,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:12:17,126 INFO L87 Difference]: Start difference. First operand 2283 states and 4209 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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-11 04:12:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:18,035 INFO L93 Difference]: Finished difference Result 2690 states and 4863 transitions. [2024-10-11 04:12:18,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:12:18,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 81 [2024-10-11 04:12:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:18,045 INFO L225 Difference]: With dead ends: 2690 [2024-10-11 04:12:18,045 INFO L226 Difference]: Without dead ends: 2538 [2024-10-11 04:12:18,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:12:18,048 INFO L432 NwaCegarLoop]: 4086 mSDtfsCounter, 4562 mSDsluCounter, 12233 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4573 SdHoareTripleChecker+Valid, 16319 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:18,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4573 Valid, 16319 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:12:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2024-10-11 04:12:18,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2439. [2024-10-11 04:12:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2439 states, 2393 states have (on average 1.8340994567488509) internal successors, (4389), 2396 states have internal predecessors, (4389), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-10-11 04:12:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 4454 transitions. [2024-10-11 04:12:18,104 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 4454 transitions. Word has length 81 [2024-10-11 04:12:18,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:18,105 INFO L471 AbstractCegarLoop]: Abstraction has 2439 states and 4454 transitions. [2024-10-11 04:12:18,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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-11 04:12:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 4454 transitions. [2024-10-11 04:12:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:12:18,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:18,107 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] [2024-10-11 04:12:18,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:12:18,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:18,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:18,108 INFO L85 PathProgramCache]: Analyzing trace with hash -927081943, now seen corresponding path program 1 times [2024-10-11 04:12:18,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:18,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478967828] [2024-10-11 04:12:18,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:18,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:18,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:18,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:18,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:18,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:18,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:12:18,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:18,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478967828] [2024-10-11 04:12:18,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478967828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:18,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:18,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:18,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93700709] [2024-10-11 04:12:18,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:18,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:18,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:18,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:18,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:18,261 INFO L87 Difference]: Start difference. First operand 2439 states and 4454 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:19,532 INFO L93 Difference]: Finished difference Result 3055 states and 5437 transitions. [2024-10-11 04:12:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:12:19,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2024-10-11 04:12:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:19,542 INFO L225 Difference]: With dead ends: 3055 [2024-10-11 04:12:19,543 INFO L226 Difference]: Without dead ends: 2747 [2024-10-11 04:12:19,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:12:19,546 INFO L432 NwaCegarLoop]: 4180 mSDtfsCounter, 4567 mSDsluCounter, 16521 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 20701 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:19,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 20701 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:12:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2024-10-11 04:12:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2584. [2024-10-11 04:12:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2584 states, 2518 states have (on average 1.8200953137410643) internal successors, (4583), 2522 states have internal predecessors, (4583), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-11 04:12:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 4676 transitions. [2024-10-11 04:12:19,613 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 4676 transitions. Word has length 81 [2024-10-11 04:12:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:19,613 INFO L471 AbstractCegarLoop]: Abstraction has 2584 states and 4676 transitions. [2024-10-11 04:12:19,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 4676 transitions. [2024-10-11 04:12:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:12:19,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:19,616 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] [2024-10-11 04:12:19,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:12:19,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:19,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:19,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2143235669, now seen corresponding path program 1 times [2024-10-11 04:12:19,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:19,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660747995] [2024-10-11 04:12:19,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:19,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:19,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:19,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:19,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:19,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:19,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:12:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:19,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660747995] [2024-10-11 04:12:19,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660747995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:19,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:19,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:19,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136724571] [2024-10-11 04:12:19,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:19,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:19,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:19,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:19,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:19,883 INFO L87 Difference]: Start difference. First operand 2584 states and 4676 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:20,979 INFO L93 Difference]: Finished difference Result 3589 states and 6275 transitions. [2024-10-11 04:12:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:12:20,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2024-10-11 04:12:20,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:20,994 INFO L225 Difference]: With dead ends: 3589 [2024-10-11 04:12:20,995 INFO L226 Difference]: Without dead ends: 3136 [2024-10-11 04:12:21,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:12:21,001 INFO L432 NwaCegarLoop]: 4095 mSDtfsCounter, 4613 mSDsluCounter, 16302 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4624 SdHoareTripleChecker+Valid, 20397 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:21,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4624 Valid, 20397 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:12:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2024-10-11 04:12:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 2875. [2024-10-11 04:12:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2769 states have (on average 1.795594077284218) internal successors, (4972), 2775 states have internal predecessors, (4972), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-11 04:12:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 5125 transitions. [2024-10-11 04:12:21,077 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 5125 transitions. Word has length 81 [2024-10-11 04:12:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:21,077 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 5125 transitions. [2024-10-11 04:12:21,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 5125 transitions. [2024-10-11 04:12:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:12:21,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:21,079 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] [2024-10-11 04:12:21,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:12:21,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:21,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:21,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1419764201, now seen corresponding path program 1 times [2024-10-11 04:12:21,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:21,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434615273] [2024-10-11 04:12:21,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:21,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:21,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:21,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:21,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:21,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:21,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:12:21,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:21,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434615273] [2024-10-11 04:12:21,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434615273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:21,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:21,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:21,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661219069] [2024-10-11 04:12:21,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:21,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:21,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:21,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:21,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:21,257 INFO L87 Difference]: Start difference. First operand 2875 states and 5125 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:21,877 INFO L93 Difference]: Finished difference Result 3870 states and 6717 transitions. [2024-10-11 04:12:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:12:21,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2024-10-11 04:12:21,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:21,892 INFO L225 Difference]: With dead ends: 3870 [2024-10-11 04:12:21,892 INFO L226 Difference]: Without dead ends: 3126 [2024-10-11 04:12:21,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:12:21,898 INFO L432 NwaCegarLoop]: 4073 mSDtfsCounter, 4416 mSDsluCounter, 16172 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4428 SdHoareTripleChecker+Valid, 20245 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:21,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4428 Valid, 20245 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 04:12:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2024-10-11 04:12:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 2875. [2024-10-11 04:12:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2769 states have (on average 1.79378837125316) internal successors, (4967), 2775 states have internal predecessors, (4967), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-11 04:12:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 5120 transitions. [2024-10-11 04:12:21,973 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 5120 transitions. Word has length 81 [2024-10-11 04:12:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:21,973 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 5120 transitions. [2024-10-11 04:12:21,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 5120 transitions. [2024-10-11 04:12:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:12:21,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:21,975 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] [2024-10-11 04:12:21,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:12:21,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:21,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:21,975 INFO L85 PathProgramCache]: Analyzing trace with hash -266415637, now seen corresponding path program 1 times [2024-10-11 04:12:21,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:21,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343098345] [2024-10-11 04:12:21,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:21,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:22,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:22,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:22,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:22,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:22,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:12:22,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:22,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343098345] [2024-10-11 04:12:22,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343098345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:22,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:22,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:22,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326016654] [2024-10-11 04:12:22,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:22,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:22,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:22,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:22,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:22,094 INFO L87 Difference]: Start difference. First operand 2875 states and 5120 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:23,440 INFO L93 Difference]: Finished difference Result 4829 states and 8192 transitions. [2024-10-11 04:12:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:12:23,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2024-10-11 04:12:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:23,455 INFO L225 Difference]: With dead ends: 4829 [2024-10-11 04:12:23,456 INFO L226 Difference]: Without dead ends: 4085 [2024-10-11 04:12:23,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:12:23,461 INFO L432 NwaCegarLoop]: 4176 mSDtfsCounter, 4711 mSDsluCounter, 16516 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 20692 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:23,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 20692 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:12:23,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2024-10-11 04:12:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3459. [2024-10-11 04:12:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3277 states have (on average 1.7552639609398841) internal successors, (5752), 3287 states have internal predecessors, (5752), 118 states have call successors, (118), 54 states have call predecessors, (118), 62 states have return successors, (153), 125 states have call predecessors, (153), 118 states have call successors, (153) [2024-10-11 04:12:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 6023 transitions. [2024-10-11 04:12:23,562 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 6023 transitions. Word has length 81 [2024-10-11 04:12:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:23,562 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 6023 transitions. [2024-10-11 04:12:23,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 6023 transitions. [2024-10-11 04:12:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:12:23,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:23,565 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] [2024-10-11 04:12:23,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:12:23,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:23,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:23,565 INFO L85 PathProgramCache]: Analyzing trace with hash -683812243, now seen corresponding path program 1 times [2024-10-11 04:12:23,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:23,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227861393] [2024-10-11 04:12:23,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:23,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:23,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:23,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:23,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:23,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:12:23,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:23,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227861393] [2024-10-11 04:12:23,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227861393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:23,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:23,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288087330] [2024-10-11 04:12:23,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:23,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:23,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:23,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:23,689 INFO L87 Difference]: Start difference. First operand 3459 states and 6023 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:25,278 INFO L93 Difference]: Finished difference Result 6997 states and 11579 transitions. [2024-10-11 04:12:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:12:25,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2024-10-11 04:12:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:25,314 INFO L225 Difference]: With dead ends: 6997 [2024-10-11 04:12:25,314 INFO L226 Difference]: Without dead ends: 5669 [2024-10-11 04:12:25,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:12:25,326 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4584 mSDsluCounter, 16513 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4594 SdHoareTripleChecker+Valid, 20688 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:25,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4594 Valid, 20688 Invalid, 1750 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:12:25,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2024-10-11 04:12:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 4582. [2024-10-11 04:12:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4582 states, 4252 states have (on average 1.7064910630291628) internal successors, (7256), 4270 states have internal predecessors, (7256), 210 states have call successors, (210), 102 states have call predecessors, (210), 118 states have return successors, (307), 225 states have call predecessors, (307), 210 states have call successors, (307) [2024-10-11 04:12:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 7773 transitions. [2024-10-11 04:12:25,642 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 7773 transitions. Word has length 81 [2024-10-11 04:12:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:25,646 INFO L471 AbstractCegarLoop]: Abstraction has 4582 states and 7773 transitions. [2024-10-11 04:12:25,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 7773 transitions. [2024-10-11 04:12:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:12:25,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:25,651 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] [2024-10-11 04:12:25,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:12:25,651 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:25,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:25,652 INFO L85 PathProgramCache]: Analyzing trace with hash -4539989, now seen corresponding path program 1 times [2024-10-11 04:12:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:25,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17121055] [2024-10-11 04:12:25,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:25,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:25,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:25,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:25,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:25,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:12:25,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:25,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17121055] [2024-10-11 04:12:25,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17121055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:25,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:25,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:25,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418283500] [2024-10-11 04:12:25,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:25,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:25,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:25,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:25,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:25,835 INFO L87 Difference]: Start difference. First operand 4582 states and 7773 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:27,501 INFO L93 Difference]: Finished difference Result 11098 states and 18019 transitions. [2024-10-11 04:12:27,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:12:27,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2024-10-11 04:12:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:27,528 INFO L225 Difference]: With dead ends: 11098 [2024-10-11 04:12:27,528 INFO L226 Difference]: Without dead ends: 8647 [2024-10-11 04:12:27,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:12:27,536 INFO L432 NwaCegarLoop]: 4176 mSDtfsCounter, 4639 mSDsluCounter, 16516 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 20692 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:27,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 20692 Invalid, 1510 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:12:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8647 states. [2024-10-11 04:12:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8647 to 6867. [2024-10-11 04:12:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6867 states, 6249 states have (on average 1.6549847975676109) internal successors, (10342), 6283 states have internal predecessors, (10342), 386 states have call successors, (386), 198 states have call predecessors, (386), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-11 04:12:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6867 states to 6867 states and 11389 transitions. [2024-10-11 04:12:27,816 INFO L78 Accepts]: Start accepts. Automaton has 6867 states and 11389 transitions. Word has length 81 [2024-10-11 04:12:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:27,816 INFO L471 AbstractCegarLoop]: Abstraction has 6867 states and 11389 transitions. [2024-10-11 04:12:27,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 6867 states and 11389 transitions. [2024-10-11 04:12:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:12:27,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:27,821 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] [2024-10-11 04:12:27,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:12:27,821 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:27,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1957034669, now seen corresponding path program 1 times [2024-10-11 04:12:27,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:27,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463083717] [2024-10-11 04:12:27,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:27,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:27,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:27,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:27,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:12:27,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463083717] [2024-10-11 04:12:27,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463083717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:27,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704738287] [2024-10-11 04:12:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:27,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:27,932 INFO L87 Difference]: Start difference. First operand 6867 states and 11389 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:29,393 INFO L93 Difference]: Finished difference Result 19165 states and 30877 transitions. [2024-10-11 04:12:29,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:12:29,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2024-10-11 04:12:29,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:29,436 INFO L225 Difference]: With dead ends: 19165 [2024-10-11 04:12:29,436 INFO L226 Difference]: Without dead ends: 14429 [2024-10-11 04:12:29,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:12:29,452 INFO L432 NwaCegarLoop]: 4176 mSDtfsCounter, 4603 mSDsluCounter, 16516 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4619 SdHoareTripleChecker+Valid, 20692 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:29,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4619 Valid, 20692 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:12:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14429 states. [2024-10-11 04:12:29,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14429 to 11436. [2024-10-11 04:12:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11436 states, 10258 states have (on average 1.6127900175472802) internal successors, (16544), 10324 states have internal predecessors, (16544), 722 states have call successors, (722), 390 states have call predecessors, (722), 454 states have return successors, (1515), 785 states have call predecessors, (1515), 722 states have call successors, (1515) [2024-10-11 04:12:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11436 states to 11436 states and 18781 transitions. [2024-10-11 04:12:29,989 INFO L78 Accepts]: Start accepts. Automaton has 11436 states and 18781 transitions. Word has length 81 [2024-10-11 04:12:29,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:29,989 INFO L471 AbstractCegarLoop]: Abstraction has 11436 states and 18781 transitions. [2024-10-11 04:12:29,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 11436 states and 18781 transitions. [2024-10-11 04:12:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:12:30,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:30,003 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] [2024-10-11 04:12:30,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:12:30,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:30,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2136108693, now seen corresponding path program 1 times [2024-10-11 04:12:30,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:30,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070059648] [2024-10-11 04:12:30,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:30,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:30,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:30,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:30,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:30,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:12:30,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:30,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070059648] [2024-10-11 04:12:30,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070059648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:30,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:30,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762772399] [2024-10-11 04:12:30,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:30,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:30,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:30,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:30,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:30,133 INFO L87 Difference]: Start difference. First operand 11436 states and 18781 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:32,627 INFO L93 Difference]: Finished difference Result 34784 states and 56375 transitions. [2024-10-11 04:12:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:12:32,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 81 [2024-10-11 04:12:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:32,726 INFO L225 Difference]: With dead ends: 34784 [2024-10-11 04:12:32,726 INFO L226 Difference]: Without dead ends: 25479 [2024-10-11 04:12:32,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:12:32,761 INFO L432 NwaCegarLoop]: 4166 mSDtfsCounter, 4552 mSDsluCounter, 16504 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4562 SdHoareTripleChecker+Valid, 20670 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:32,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4562 Valid, 20670 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:12:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25479 states. [2024-10-11 04:12:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25479 to 20561. [2024-10-11 04:12:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20561 states, 18303 states have (on average 1.5847675244495438) internal successors, (29006), 18433 states have internal predecessors, (29006), 1358 states have call successors, (1358), 770 states have call predecessors, (1358), 898 states have return successors, (3673), 1485 states have call predecessors, (3673), 1358 states have call successors, (3673) [2024-10-11 04:12:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20561 states to 20561 states and 34037 transitions. [2024-10-11 04:12:34,028 INFO L78 Accepts]: Start accepts. Automaton has 20561 states and 34037 transitions. Word has length 81 [2024-10-11 04:12:34,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:34,029 INFO L471 AbstractCegarLoop]: Abstraction has 20561 states and 34037 transitions. [2024-10-11 04:12:34,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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-11 04:12:34,029 INFO L276 IsEmpty]: Start isEmpty. Operand 20561 states and 34037 transitions. [2024-10-11 04:12:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:12:34,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:34,043 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] [2024-10-11 04:12:34,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:12:34,043 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:34,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1575408915, now seen corresponding path program 1 times [2024-10-11 04:12:34,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:34,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732862551] [2024-10-11 04:12:34,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:34,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:34,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:34,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:34,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:34,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:34,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:12:34,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:34,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732862551] [2024-10-11 04:12:34,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732862551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:34,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:34,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:12:34,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862668560] [2024-10-11 04:12:34,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:34,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:12:34,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:34,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:12:34,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:12:34,132 INFO L87 Difference]: Start difference. First operand 20561 states and 34037 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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-11 04:12:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:36,553 INFO L93 Difference]: Finished difference Result 54256 states and 88376 transitions. [2024-10-11 04:12:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:12:36,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 81 [2024-10-11 04:12:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:36,691 INFO L225 Difference]: With dead ends: 54256 [2024-10-11 04:12:36,692 INFO L226 Difference]: Without dead ends: 35827 [2024-10-11 04:12:36,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:12:36,756 INFO L432 NwaCegarLoop]: 4213 mSDtfsCounter, 4743 mSDsluCounter, 12309 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 16522 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:36,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 16522 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:12:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35827 states. [2024-10-11 04:12:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35827 to 29690. [2024-10-11 04:12:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29690 states, 26260 states have (on average 1.562909367859863) internal successors, (41042), 26519 states have internal predecessors, (41042), 2076 states have call successors, (2076), 1160 states have call predecessors, (2076), 1352 states have return successors, (5121), 2138 states have call predecessors, (5121), 2076 states have call successors, (5121) [2024-10-11 04:12:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29690 states to 29690 states and 48239 transitions. [2024-10-11 04:12:38,773 INFO L78 Accepts]: Start accepts. Automaton has 29690 states and 48239 transitions. Word has length 81 [2024-10-11 04:12:38,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:38,774 INFO L471 AbstractCegarLoop]: Abstraction has 29690 states and 48239 transitions. [2024-10-11 04:12:38,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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-11 04:12:38,775 INFO L276 IsEmpty]: Start isEmpty. Operand 29690 states and 48239 transitions. [2024-10-11 04:12:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:12:38,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:38,856 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:38,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:12:38,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:38,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash -162136465, now seen corresponding path program 1 times [2024-10-11 04:12:38,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:38,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84001202] [2024-10-11 04:12:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:38,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:38,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:38,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:38,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:38,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:39,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:39,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 04:12:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:39,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:12:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:39,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:12:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:12:39,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:39,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84001202] [2024-10-11 04:12:39,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84001202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:12:39,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175434740] [2024-10-11 04:12:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:39,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:12:39,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:12:39,027 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:12:39,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:12:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:39,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:12:39,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:12:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 04:12:39,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:12:39,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175434740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:39,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:12:39,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:12:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357386146] [2024-10-11 04:12:39,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:39,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:12:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:39,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:12:39,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:39,234 INFO L87 Difference]: Start difference. First operand 29690 states and 48239 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:12:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:42,036 INFO L93 Difference]: Finished difference Result 84209 states and 136555 transitions. [2024-10-11 04:12:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:12:42,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2024-10-11 04:12:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:42,234 INFO L225 Difference]: With dead ends: 84209 [2024-10-11 04:12:42,235 INFO L226 Difference]: Without dead ends: 56651 [2024-10-11 04:12:42,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:42,447 INFO L432 NwaCegarLoop]: 4184 mSDtfsCounter, 4157 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4157 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:42,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4157 Valid, 4391 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:12:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56651 states. [2024-10-11 04:12:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56651 to 56455. [2024-10-11 04:12:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56455 states, 49707 states have (on average 1.5459995574064016) internal successors, (76847), 50223 states have internal predecessors, (76847), 4046 states have call successors, (4046), 2316 states have call predecessors, (4046), 2700 states have return successors, (10009), 4043 states have call predecessors, (10009), 4046 states have call successors, (10009) [2024-10-11 04:12:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56455 states to 56455 states and 90902 transitions. [2024-10-11 04:12:45,933 INFO L78 Accepts]: Start accepts. Automaton has 56455 states and 90902 transitions. Word has length 131 [2024-10-11 04:12:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:45,933 INFO L471 AbstractCegarLoop]: Abstraction has 56455 states and 90902 transitions. [2024-10-11 04:12:45,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:12:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 56455 states and 90902 transitions. [2024-10-11 04:12:46,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:12:46,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:46,381 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:46,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:12:46,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 04:12:46,586 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:46,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:46,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1117499279, now seen corresponding path program 1 times [2024-10-11 04:12:46,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:46,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917778401] [2024-10-11 04:12:46,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:46,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:46,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:46,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:12:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:46,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:12:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:46,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:12:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:46,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:12:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:46,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 04:12:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:46,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:12:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:46,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:12:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:12:46,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:46,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917778401] [2024-10-11 04:12:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917778401] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:12:46,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895883721] [2024-10-11 04:12:46,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:46,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:12:46,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:12:46,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:12:46,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:12:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:46,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:12:46,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:12:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 04:12:46,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:12:46,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895883721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:46,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:12:46,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:12:46,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964143029] [2024-10-11 04:12:46,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:46,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:12:46,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:46,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:12:46,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:46,872 INFO L87 Difference]: Start difference. First operand 56455 states and 90902 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:12:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:52,234 INFO L93 Difference]: Finished difference Result 163896 states and 264344 transitions. [2024-10-11 04:12:52,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:12:52,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2024-10-11 04:12:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:52,670 INFO L225 Difference]: With dead ends: 163896 [2024-10-11 04:12:52,670 INFO L226 Difference]: Without dead ends: 109573 [2024-10-11 04:12:52,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:52,812 INFO L432 NwaCegarLoop]: 4184 mSDtfsCounter, 4162 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4162 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:52,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4162 Valid, 4391 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:12:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109573 states.