./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eebca77f45674e9c747126627d8fffbab7911c70d4e1d781272ecaec26772b5e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:12:25,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:12:25,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:12:25,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:12:25,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:12:25,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:12:25,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:12:25,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:12:25,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:12:25,764 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:12:25,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:12:25,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:12:25,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:12:25,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:12:25,767 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:12:25,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:12:25,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:12:25,770 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:12:25,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:12:25,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:12:25,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:12:25,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:12:25,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:12:25,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:12:25,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:12:25,772 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:12:25,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:12:25,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:12:25,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:12:25,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:12:25,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:12:25,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:12:25,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:12:25,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:12:25,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:12:25,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:12:25,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:12:25,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:12:25,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:12:25,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:12:25,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:12:25,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:12:25,777 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eebca77f45674e9c747126627d8fffbab7911c70d4e1d781272ecaec26772b5e [2024-11-11 22:12:25,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:12:25,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:12:25,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:12:25,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:12:25,995 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:12:25,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c [2024-11-11 22:12:27,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:12:28,049 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:12:28,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c [2024-11-11 22:12:28,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a4454eb9/132d136d5b3f4adc889237a101c9f89b/FLAG65781f38d [2024-11-11 22:12:28,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a4454eb9/132d136d5b3f4adc889237a101c9f89b [2024-11-11 22:12:28,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:12:28,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:12:28,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:12:28,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:12:28,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:12:28,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:12:28" (1/1) ... [2024-11-11 22:12:28,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4133a2f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:28, skipping insertion in model container [2024-11-11 22:12:28,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:12:28" (1/1) ... [2024-11-11 22:12:28,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:12:29,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c[377340,377353] [2024-11-11 22:12:29,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c[383339,383352] [2024-11-11 22:12:29,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:12:29,898 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:12:31,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c[377340,377353] [2024-11-11 22:12:31,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c[383339,383352] [2024-11-11 22:12:31,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:12:31,070 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:12:31,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31 WrapperNode [2024-11-11 22:12:31,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:12:31,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:12:31,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:12:31,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:12:31,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (1/1) ... [2024-11-11 22:12:31,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (1/1) ... [2024-11-11 22:12:31,490 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13053 [2024-11-11 22:12:31,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:12:31,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:12:31,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:12:31,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:12:31,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (1/1) ... [2024-11-11 22:12:31,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (1/1) ... [2024-11-11 22:12:31,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (1/1) ... [2024-11-11 22:12:31,608 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 22:12:31,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (1/1) ... [2024-11-11 22:12:31,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (1/1) ... [2024-11-11 22:12:31,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (1/1) ... [2024-11-11 22:12:31,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (1/1) ... [2024-11-11 22:12:31,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (1/1) ... [2024-11-11 22:12:31,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (1/1) ... [2024-11-11 22:12:31,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:12:31,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:12:31,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:12:31,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:12:31,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (1/1) ... [2024-11-11 22:12:31,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:12:31,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:12:32,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:12:32,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:12:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:12:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 22:12:32,072 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 22:12:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:12:32,073 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:12:32,073 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 22:12:32,074 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 22:12:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 22:12:32,074 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 22:12:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 22:12:32,074 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 22:12:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 22:12:32,074 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 22:12:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:12:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:12:32,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:12:32,195 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:12:32,197 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:12:38,707 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2024-11-11 22:12:38,708 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:12:38,765 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:12:38,766 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-11 22:12:38,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:12:38 BoogieIcfgContainer [2024-11-11 22:12:38,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:12:38,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:12:38,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:12:38,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:12:38,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:12:28" (1/3) ... [2024-11-11 22:12:38,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b396ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:12:38, skipping insertion in model container [2024-11-11 22:12:38,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:12:31" (2/3) ... [2024-11-11 22:12:38,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b396ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:12:38, skipping insertion in model container [2024-11-11 22:12:38,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:12:38" (3/3) ... [2024-11-11 22:12:38,776 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.09.cil-1.c [2024-11-11 22:12:38,790 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:12:38,791 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:12:38,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:12:38,903 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;@277a49a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:12:38,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:12:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 2500 states, 2468 states have (on average 1.8435980551053484) internal successors, (4550), 2471 states have internal predecessors, (4550), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-11 22:12:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:12:38,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:12:38,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:12:38,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:12:38,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:12:38,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2141989661, now seen corresponding path program 1 times [2024-11-11 22:12:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:12:38,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21097912] [2024-11-11 22:12:38,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:12:38,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:12:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:39,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:12:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:39,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:12:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:39,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:12:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:39,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:12:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:39,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:12:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:12:39,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:12:39,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21097912] [2024-11-11 22:12:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21097912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:12:39,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:12:39,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:12:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277167605] [2024-11-11 22:12:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:12:39,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:12:39,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:12:39,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:12:39,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:12:39,499 INFO L87 Difference]: Start difference. First operand has 2500 states, 2468 states have (on average 1.8435980551053484) internal successors, (4550), 2471 states have internal predecessors, (4550), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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-11-11 22:12:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:12:40,873 INFO L93 Difference]: Finished difference Result 5101 states and 9365 transitions. [2024-11-11 22:12:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:12:40,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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 145 [2024-11-11 22:12:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:12:40,902 INFO L225 Difference]: With dead ends: 5101 [2024-11-11 22:12:40,902 INFO L226 Difference]: Without dead ends: 2542 [2024-11-11 22:12:40,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:12:40,912 INFO L435 NwaCegarLoop]: 4314 mSDtfsCounter, 821 mSDsluCounter, 12407 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 16721 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:12:40,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 16721 Invalid, 855 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:12:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-11-11 22:12:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2433. [2024-11-11 22:12:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 2402 states have (on average 1.8288925895087427) internal successors, (4393), 2404 states have internal predecessors, (4393), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-11 22:12:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 4439 transitions. [2024-11-11 22:12:41,025 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 4439 transitions. Word has length 145 [2024-11-11 22:12:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:12:41,026 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 4439 transitions. [2024-11-11 22:12:41,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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-11-11 22:12:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 4439 transitions. [2024-11-11 22:12:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:12:41,029 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:12:41,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:12:41,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:12:41,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:12:41,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:12:41,030 INFO L85 PathProgramCache]: Analyzing trace with hash -535537185, now seen corresponding path program 1 times [2024-11-11 22:12:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:12:41,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384247801] [2024-11-11 22:12:41,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:12:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:12:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:41,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:12:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:41,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:12:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:12:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:41,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:12:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:41,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:12:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:12:41,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:12:41,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384247801] [2024-11-11 22:12:41,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384247801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:12:41,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:12:41,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:12:41,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839799538] [2024-11-11 22:12:41,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:12:41,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:12:41,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:12:41,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:12:41,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:12:41,256 INFO L87 Difference]: Start difference. First operand 2433 states and 4439 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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-11-11 22:12:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:12:43,925 INFO L93 Difference]: Finished difference Result 3253 states and 5746 transitions. [2024-11-11 22:12:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:12:43,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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 145 [2024-11-11 22:12:43,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:12:43,940 INFO L225 Difference]: With dead ends: 3253 [2024-11-11 22:12:43,941 INFO L226 Difference]: Without dead ends: 2958 [2024-11-11 22:12:43,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:12:43,944 INFO L435 NwaCegarLoop]: 4221 mSDtfsCounter, 5183 mSDsluCounter, 12669 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5199 SdHoareTripleChecker+Valid, 16890 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:12:43,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5199 Valid, 16890 Invalid, 1857 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:12:43,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2024-11-11 22:12:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2741. [2024-11-11 22:12:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2741 states, 2685 states have (on average 1.8011173184357543) internal successors, (4836), 2688 states have internal predecessors, (4836), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-11-11 22:12:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4921 transitions. [2024-11-11 22:12:44,040 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4921 transitions. Word has length 145 [2024-11-11 22:12:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:12:44,041 INFO L471 AbstractCegarLoop]: Abstraction has 2741 states and 4921 transitions. [2024-11-11 22:12:44,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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-11-11 22:12:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4921 transitions. [2024-11-11 22:12:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:12:44,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:12:44,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:12:44,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:12:44,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:12:44,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:12:44,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1207466339, now seen corresponding path program 1 times [2024-11-11 22:12:44,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:12:44,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408385254] [2024-11-11 22:12:44,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:12:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:12:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:44,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:12:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:44,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:12:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:12:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:12:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:44,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:12:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:12:44,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:12:44,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408385254] [2024-11-11 22:12:44,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408385254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:12:44,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:12:44,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:12:44,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61415882] [2024-11-11 22:12:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:12:44,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:12:44,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:12:44,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:12:44,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:12:44,362 INFO L87 Difference]: Start difference. First operand 2741 states and 4921 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:12:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:12:47,206 INFO L93 Difference]: Finished difference Result 3991 states and 6913 transitions. [2024-11-11 22:12:47,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:12:47,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-11 22:12:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:12:47,217 INFO L225 Difference]: With dead ends: 3991 [2024-11-11 22:12:47,218 INFO L226 Difference]: Without dead ends: 3388 [2024-11-11 22:12:47,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:12:47,220 INFO L435 NwaCegarLoop]: 4421 mSDtfsCounter, 5214 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2794 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5230 SdHoareTripleChecker+Valid, 21831 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:12:47,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5230 Valid, 21831 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2794 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:12:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2024-11-11 22:12:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3028. [2024-11-11 22:12:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 2947 states have (on average 1.7770614183915847) internal successors, (5237), 2951 states have internal predecessors, (5237), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-11-11 22:12:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 5360 transitions. [2024-11-11 22:12:47,280 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 5360 transitions. Word has length 145 [2024-11-11 22:12:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:12:47,280 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 5360 transitions. [2024-11-11 22:12:47,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:12:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 5360 transitions. [2024-11-11 22:12:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:12:47,282 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:12:47,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:12:47,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:12:47,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:12:47,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:12:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2140463071, now seen corresponding path program 1 times [2024-11-11 22:12:47,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:12:47,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742638360] [2024-11-11 22:12:47,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:12:47,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:12:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:47,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:12:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:47,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:12:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:12:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:47,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:12:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:47,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:12:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:12:47,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:12:47,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742638360] [2024-11-11 22:12:47,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742638360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:12:47,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:12:47,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:12:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770810764] [2024-11-11 22:12:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:12:47,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:12:47,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:12:47,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:12:47,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:12:47,458 INFO L87 Difference]: Start difference. First operand 3028 states and 5360 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:12:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:12:49,985 INFO L93 Difference]: Finished difference Result 5078 states and 8620 transitions. [2024-11-11 22:12:49,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:12:49,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-11 22:12:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:12:50,008 INFO L225 Difference]: With dead ends: 5078 [2024-11-11 22:12:50,008 INFO L226 Difference]: Without dead ends: 4188 [2024-11-11 22:12:50,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:12:50,018 INFO L435 NwaCegarLoop]: 4419 mSDtfsCounter, 5208 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5224 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:12:50,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5224 Valid, 21829 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 22:12:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2024-11-11 22:12:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 3606. [2024-11-11 22:12:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 3475 states have (on average 1.7398561151079137) internal successors, (6046), 3481 states have internal predecessors, (6046), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-11-11 22:12:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 6249 transitions. [2024-11-11 22:12:50,167 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 6249 transitions. Word has length 145 [2024-11-11 22:12:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:12:50,167 INFO L471 AbstractCegarLoop]: Abstraction has 3606 states and 6249 transitions. [2024-11-11 22:12:50,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:12:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 6249 transitions. [2024-11-11 22:12:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:12:50,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:12:50,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:12:50,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:12:50,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:12:50,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:12:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash 104095327, now seen corresponding path program 1 times [2024-11-11 22:12:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:12:50,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591486563] [2024-11-11 22:12:50,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:12:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:12:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:12:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:50,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:12:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:50,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:12:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:12:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:50,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:12:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:12:50,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:12:50,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591486563] [2024-11-11 22:12:50,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591486563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:12:50,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:12:50,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:12:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086009933] [2024-11-11 22:12:50,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:12:50,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:12:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:12:50,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:12:50,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:12:50,369 INFO L87 Difference]: Start difference. First operand 3606 states and 6249 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:12:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:12:52,969 INFO L93 Difference]: Finished difference Result 7178 states and 11897 transitions. [2024-11-11 22:12:52,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:12:52,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-11 22:12:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:12:52,996 INFO L225 Difference]: With dead ends: 7178 [2024-11-11 22:12:52,997 INFO L226 Difference]: Without dead ends: 5710 [2024-11-11 22:12:53,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:12:53,007 INFO L435 NwaCegarLoop]: 4419 mSDtfsCounter, 5207 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:12:53,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 21829 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2760 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 22:12:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2024-11-11 22:12:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 4763. [2024-11-11 22:12:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4763 states, 4532 states have (on average 1.6910856134157104) internal successors, (7664), 4542 states have internal predecessors, (7664), 167 states have call successors, (167), 54 states have call predecessors, (167), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-11-11 22:12:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4763 states to 4763 states and 8033 transitions. [2024-11-11 22:12:53,198 INFO L78 Accepts]: Start accepts. Automaton has 4763 states and 8033 transitions. Word has length 145 [2024-11-11 22:12:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:12:53,199 INFO L471 AbstractCegarLoop]: Abstraction has 4763 states and 8033 transitions. [2024-11-11 22:12:53,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:12:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 4763 states and 8033 transitions. [2024-11-11 22:12:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:12:53,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:12:53,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:12:53,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:12:53,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:12:53,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:12:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash 592142433, now seen corresponding path program 1 times [2024-11-11 22:12:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:12:53,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524629246] [2024-11-11 22:12:53,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:12:53,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:12:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:53,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:12:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:53,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:12:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:12:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:53,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:12:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:12:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:12:53,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:12:53,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524629246] [2024-11-11 22:12:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524629246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:12:53,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:12:53,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:12:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480838853] [2024-11-11 22:12:53,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:12:53,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:12:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:12:53,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:12:53,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:12:53,418 INFO L87 Difference]: Start difference. First operand 4763 states and 8033 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:12:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:12:56,684 INFO L93 Difference]: Finished difference Result 11377 states and 18467 transitions. [2024-11-11 22:12:56,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:12:56,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-11 22:12:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:12:56,716 INFO L225 Difference]: With dead ends: 11377 [2024-11-11 22:12:56,717 INFO L226 Difference]: Without dead ends: 8752 [2024-11-11 22:12:56,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:12:56,727 INFO L435 NwaCegarLoop]: 4419 mSDtfsCounter, 5206 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5222 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:12:56,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5222 Valid, 21829 Invalid, 2804 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 22:12:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8752 states. [2024-11-11 22:12:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8752 to 7084. [2024-11-11 22:12:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7084 states, 6653 states have (on average 1.6398617165188636) internal successors, (10910), 6671 states have internal predecessors, (10910), 311 states have call successors, (311), 102 states have call predecessors, (311), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-11 22:12:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7084 states to 7084 states and 11629 transitions. [2024-11-11 22:12:57,221 INFO L78 Accepts]: Start accepts. Automaton has 7084 states and 11629 transitions. Word has length 145 [2024-11-11 22:12:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:12:57,222 INFO L471 AbstractCegarLoop]: Abstraction has 7084 states and 11629 transitions. [2024-11-11 22:12:57,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:12:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7084 states and 11629 transitions. [2024-11-11 22:12:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:12:57,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:12:57,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:12:57,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:12:57,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:12:57,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:12:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash -500492769, now seen corresponding path program 1 times [2024-11-11 22:12:57,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:12:57,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391589095] [2024-11-11 22:12:57,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:12:57,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:12:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:57,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:12:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:12:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:57,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:12:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:57,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:12:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:57,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:12:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:12:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:12:57,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:12:57,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391589095] [2024-11-11 22:12:57,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391589095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:12:57,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:12:57,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:12:57,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505174265] [2024-11-11 22:12:57,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:12:57,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:12:57,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:12:57,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:12:57,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:12:57,518 INFO L87 Difference]: Start difference. First operand 7084 states and 11629 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:13:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:13:00,493 INFO L93 Difference]: Finished difference Result 19776 states and 31669 transitions. [2024-11-11 22:13:00,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:13:00,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-11 22:13:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:13:00,530 INFO L225 Difference]: With dead ends: 19776 [2024-11-11 22:13:00,531 INFO L226 Difference]: Without dead ends: 14830 [2024-11-11 22:13:00,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:13:00,549 INFO L435 NwaCegarLoop]: 4231 mSDtfsCounter, 5285 mSDsluCounter, 16870 mSDsCounter, 0 mSdLazyCounter, 2341 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5301 SdHoareTripleChecker+Valid, 21101 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:13:00,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5301 Valid, 21101 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2341 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 22:13:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14830 states. [2024-11-11 22:13:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14830 to 11741. [2024-11-11 22:13:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11741 states, 10910 states have (on average 1.5970669110907425) internal successors, (17424), 10944 states have internal predecessors, (17424), 599 states have call successors, (599), 198 states have call predecessors, (599), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-11 22:13:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 18897 transitions. [2024-11-11 22:13:01,027 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 18897 transitions. Word has length 145 [2024-11-11 22:13:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:13:01,028 INFO L471 AbstractCegarLoop]: Abstraction has 11741 states and 18897 transitions. [2024-11-11 22:13:01,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:13:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 18897 transitions. [2024-11-11 22:13:01,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:13:01,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:13:01,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:13:01,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:13:01,147 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:13:01,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:13:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1782665055, now seen corresponding path program 1 times [2024-11-11 22:13:01,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:13:01,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886824797] [2024-11-11 22:13:01,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:13:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:13:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:01,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:13:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:01,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:13:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:13:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:01,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:13:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:01,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:13:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:13:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:13:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886824797] [2024-11-11 22:13:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886824797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:13:01,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:13:01,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:13:01,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112338381] [2024-11-11 22:13:01,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:13:01,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:13:01,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:13:01,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:13:01,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:13:01,368 INFO L87 Difference]: Start difference. First operand 11741 states and 18897 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:13:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:13:03,042 INFO L93 Difference]: Finished difference Result 24602 states and 39478 transitions. [2024-11-11 22:13:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:13:03,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-11 22:13:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:13:03,083 INFO L225 Difference]: With dead ends: 24602 [2024-11-11 22:13:03,084 INFO L226 Difference]: Without dead ends: 14999 [2024-11-11 22:13:03,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:13:03,117 INFO L435 NwaCegarLoop]: 4206 mSDtfsCounter, 4993 mSDsluCounter, 12488 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5010 SdHoareTripleChecker+Valid, 16694 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:13:03,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5010 Valid, 16694 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:13:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14999 states. [2024-11-11 22:13:03,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14999 to 11741. [2024-11-11 22:13:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11741 states, 10910 states have (on average 1.5940421631530706) internal successors, (17391), 10944 states have internal predecessors, (17391), 599 states have call successors, (599), 198 states have call predecessors, (599), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-11 22:13:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 18864 transitions. [2024-11-11 22:13:03,780 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 18864 transitions. Word has length 145 [2024-11-11 22:13:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:13:03,782 INFO L471 AbstractCegarLoop]: Abstraction has 11741 states and 18864 transitions. [2024-11-11 22:13:03,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:13:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 18864 transitions. [2024-11-11 22:13:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:13:03,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:13:03,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:13:03,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:13:03,791 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:13:03,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:13:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash 669826527, now seen corresponding path program 1 times [2024-11-11 22:13:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:13:03,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719507957] [2024-11-11 22:13:03,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:13:03,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:13:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:03,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:13:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:03,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:13:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:03,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:13:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:13:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:03,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:13:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:13:03,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:13:03,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719507957] [2024-11-11 22:13:03,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719507957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:13:03,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:13:03,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:13:03,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462153448] [2024-11-11 22:13:03,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:13:03,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:13:03,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:13:03,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:13:03,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:13:03,990 INFO L87 Difference]: Start difference. First operand 11741 states and 18864 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:13:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:13:07,701 INFO L93 Difference]: Finished difference Result 36541 states and 58035 transitions. [2024-11-11 22:13:07,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:13:07,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-11 22:13:07,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:13:07,816 INFO L225 Difference]: With dead ends: 36541 [2024-11-11 22:13:07,816 INFO L226 Difference]: Without dead ends: 26938 [2024-11-11 22:13:07,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:13:07,866 INFO L435 NwaCegarLoop]: 4419 mSDtfsCounter, 5197 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5213 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:13:07,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5213 Valid, 21829 Invalid, 2753 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:13:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26938 states. [2024-11-11 22:13:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26938 to 21119. [2024-11-11 22:13:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21119 states, 19488 states have (on average 1.5633723316912973) internal successors, (30467), 19554 states have internal predecessors, (30467), 1175 states have call successors, (1175), 390 states have call predecessors, (1175), 454 states have return successors, (1968), 1238 states have call predecessors, (1968), 1175 states have call successors, (1968) [2024-11-11 22:13:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21119 states to 21119 states and 33610 transitions. [2024-11-11 22:13:09,201 INFO L78 Accepts]: Start accepts. Automaton has 21119 states and 33610 transitions. Word has length 145 [2024-11-11 22:13:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:13:09,201 INFO L471 AbstractCegarLoop]: Abstraction has 21119 states and 33610 transitions. [2024-11-11 22:13:09,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:13:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 21119 states and 33610 transitions. [2024-11-11 22:13:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:13:09,212 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:13:09,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:13:09,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:13:09,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:13:09,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:13:09,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1052176159, now seen corresponding path program 1 times [2024-11-11 22:13:09,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:13:09,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754666151] [2024-11-11 22:13:09,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:13:09,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:13:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:09,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:13:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:09,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:13:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:09,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:13:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:09,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:13:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:09,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:13:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:13:09,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:13:09,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754666151] [2024-11-11 22:13:09,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754666151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:13:09,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:13:09,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:13:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855552165] [2024-11-11 22:13:09,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:13:09,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:13:09,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:13:09,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:13:09,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:13:09,507 INFO L87 Difference]: Start difference. First operand 21119 states and 33610 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:13:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:13:14,812 INFO L93 Difference]: Finished difference Result 70141 states and 111643 transitions. [2024-11-11 22:13:14,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:13:14,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-11 22:13:14,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:13:14,952 INFO L225 Difference]: With dead ends: 70141 [2024-11-11 22:13:14,952 INFO L226 Difference]: Without dead ends: 51160 [2024-11-11 22:13:14,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:13:14,994 INFO L435 NwaCegarLoop]: 4419 mSDtfsCounter, 5202 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5218 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:13:14,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5218 Valid, 21829 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2678 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 22:13:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51160 states. [2024-11-11 22:13:16,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51160 to 39936. [2024-11-11 22:13:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39936 states, 36705 states have (on average 1.544993870044953) internal successors, (56709), 36835 states have internal predecessors, (56709), 2327 states have call successors, (2327), 774 states have call predecessors, (2327), 902 states have return successors, (4642), 2454 states have call predecessors, (4642), 2327 states have call successors, (4642) [2024-11-11 22:13:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39936 states to 39936 states and 63678 transitions. [2024-11-11 22:13:16,887 INFO L78 Accepts]: Start accepts. Automaton has 39936 states and 63678 transitions. Word has length 145 [2024-11-11 22:13:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:13:16,888 INFO L471 AbstractCegarLoop]: Abstraction has 39936 states and 63678 transitions. [2024-11-11 22:13:16,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:13:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 39936 states and 63678 transitions. [2024-11-11 22:13:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:13:16,909 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:13:16,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:13:16,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:13:16,910 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:13:16,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:13:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1384819297, now seen corresponding path program 1 times [2024-11-11 22:13:16,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:13:16,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056375439] [2024-11-11 22:13:16,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:13:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:13:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:16,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:13:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:17,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:13:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:13:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:17,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:13:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:17,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:13:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:13:17,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:13:17,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056375439] [2024-11-11 22:13:17,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056375439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:13:17,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:13:17,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:13:17,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963360350] [2024-11-11 22:13:17,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:13:17,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:13:17,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:13:17,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:13:17,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:13:17,396 INFO L87 Difference]: Start difference. First operand 39936 states and 63678 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:13:24,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:13:24,582 INFO L93 Difference]: Finished difference Result 152954 states and 244639 transitions. [2024-11-11 22:13:24,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:13:24,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-11 22:13:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:13:25,145 INFO L225 Difference]: With dead ends: 152954 [2024-11-11 22:13:25,145 INFO L226 Difference]: Without dead ends: 115156 [2024-11-11 22:13:25,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:13:25,244 INFO L435 NwaCegarLoop]: 4416 mSDtfsCounter, 5279 mSDsluCounter, 17399 mSDsCounter, 0 mSdLazyCounter, 3197 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5294 SdHoareTripleChecker+Valid, 21815 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:13:25,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5294 Valid, 21815 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3197 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 22:13:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115156 states. [2024-11-11 22:13:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115156 to 76802. [2024-11-11 22:13:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76802 states, 70499 states have (on average 1.537057263223592) internal successors, (108361), 70757 states have internal predecessors, (108361), 4503 states have call successors, (4503), 1542 states have call predecessors, (4503), 1798 states have return successors, (11320), 4758 states have call predecessors, (11320), 4503 states have call successors, (11320) [2024-11-11 22:13:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76802 states to 76802 states and 124184 transitions. [2024-11-11 22:13:30,593 INFO L78 Accepts]: Start accepts. Automaton has 76802 states and 124184 transitions. Word has length 145 [2024-11-11 22:13:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:13:30,594 INFO L471 AbstractCegarLoop]: Abstraction has 76802 states and 124184 transitions. [2024-11-11 22:13:30,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:13:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 76802 states and 124184 transitions. [2024-11-11 22:13:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 22:13:30,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:13:30,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:13:30,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:13:30,638 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:13:30,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:13:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash 617066973, now seen corresponding path program 1 times [2024-11-11 22:13:30,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:13:30,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479608240] [2024-11-11 22:13:30,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:13:30,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:13:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:30,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:13:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:30,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:13:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:13:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:30,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:13:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:13:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:13:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:13:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:13:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479608240] [2024-11-11 22:13:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479608240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:13:30,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:13:30,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:13:30,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299876218] [2024-11-11 22:13:30,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:13:30,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:13:30,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:13:30,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:13:30,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:13:30,918 INFO L87 Difference]: Start difference. First operand 76802 states and 124184 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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)