./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label40+token_ring.12.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'e81bb624b13c4231a79ab1bd2052849a1a89cc393bc6bb2c02746b61da23cad6'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.12.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e81bb624b13c4231a79ab1bd2052849a1a89cc393bc6bb2c02746b61da23cad6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:55:16,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:55:17,000 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:55:17,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:55:17,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:55:17,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:55:17,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:55:17,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:55:17,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:55:17,031 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:55:17,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:55:17,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:55:17,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:55:17,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:55:17,034 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:55:17,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:55:17,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:55:17,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:55:17,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:55:17,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:55:17,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:55:17,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:55:17,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:55:17,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:55:17,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:55:17,036 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:55:17,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:55:17,036 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:55:17,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:55:17,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:55:17,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:55:17,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:55:17,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:55:17,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:55:17,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:55:17,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:55:17,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:55:17,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:55:17,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:55:17,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:55:17,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:55:17,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:55:17,037 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> e81bb624b13c4231a79ab1bd2052849a1a89cc393bc6bb2c02746b61da23cad6 [2024-11-07 00:55:17,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:55:17,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:55:17,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:55:17,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:55:17,311 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:55:17,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label40+token_ring.12.cil-2.c [2024-11-07 00:55:18,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:55:19,182 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:55:19,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.12.cil-2.c [2024-11-07 00:55:19,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb2924276/30d8a94b4ab9426dbeb24204ffb0237d/FLAG3c2b48fb0 [2024-11-07 00:55:19,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb2924276/30d8a94b4ab9426dbeb24204ffb0237d [2024-11-07 00:55:19,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:55:19,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:55:19,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:55:19,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:55:19,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:55:19,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:55:19" (1/1) ... [2024-11-07 00:55:19,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8677f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:19, skipping insertion in model container [2024-11-07 00:55:19,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:55:19" (1/1) ... [2024-11-07 00:55:19,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:55:20,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.12.cil-2.c[377069,377082] [2024-11-07 00:55:20,832 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.12.cil-2.c[383339,383352] [2024-11-07 00:55:21,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:55:21,121 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:55:21,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.12.cil-2.c[377069,377082] [2024-11-07 00:55:21,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.12.cil-2.c[383339,383352] [2024-11-07 00:55:21,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:55:21,917 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:55:21,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21 WrapperNode [2024-11-07 00:55:21,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:55:21,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:55:21,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:55:21,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:55:21,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (1/1) ... [2024-11-07 00:55:22,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (1/1) ... [2024-11-07 00:55:22,462 INFO L138 Inliner]: procedures = 68, calls = 77, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 13233 [2024-11-07 00:55:22,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:55:22,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:55:22,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:55:22,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:55:22,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (1/1) ... [2024-11-07 00:55:22,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (1/1) ... [2024-11-07 00:55:22,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (1/1) ... [2024-11-07 00:55:22,713 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-07 00:55:22,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (1/1) ... [2024-11-07 00:55:22,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (1/1) ... [2024-11-07 00:55:22,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (1/1) ... [2024-11-07 00:55:22,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (1/1) ... [2024-11-07 00:55:23,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (1/1) ... [2024-11-07 00:55:23,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (1/1) ... [2024-11-07 00:55:23,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:55:23,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:55:23,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:55:23,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:55:23,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (1/1) ... [2024-11-07 00:55:23,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:55:23,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:55:23,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:55:23,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:55:23,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:55:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:55:23,163 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:55:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:55:23,163 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:55:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:55:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:55:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:55:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:55:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:55:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:55:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:55:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:55:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:55:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:55:23,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:55:23,330 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:55:23,332 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:55:31,343 INFO L? ?]: Removed 1755 outVars from TransFormulas that were not future-live. [2024-11-07 00:55:31,343 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:55:31,409 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:55:31,409 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-07 00:55:31,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:55:31 BoogieIcfgContainer [2024-11-07 00:55:31,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:55:31,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:55:31,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:55:31,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:55:31,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:55:19" (1/3) ... [2024-11-07 00:55:31,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a899037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:55:31, skipping insertion in model container [2024-11-07 00:55:31,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:21" (2/3) ... [2024-11-07 00:55:31,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a899037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:55:31, skipping insertion in model container [2024-11-07 00:55:31,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:55:31" (3/3) ... [2024-11-07 00:55:31,420 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.12.cil-2.c [2024-11-07 00:55:31,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:55:31,433 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:55:31,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:55:31,553 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;@5abfd5a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:55:31,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:55:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 2578 states, 2543 states have (on average 1.8387731026346834) internal successors, (4676), 2546 states have internal predecessors, (4676), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 00:55:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 00:55:31,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:31,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:55:31,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:31,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash -80490959, now seen corresponding path program 1 times [2024-11-07 00:55:31,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:31,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653789381] [2024-11-07 00:55:31,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:31,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:32,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:55:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:32,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:55:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:32,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:55:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:32,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:55:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:32,483 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-07 00:55:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:32,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653789381] [2024-11-07 00:55:32,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653789381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:32,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:32,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:55:32,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375596023] [2024-11-07 00:55:32,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:32,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:55:32,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:32,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:55:32,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:55:32,550 INFO L87 Difference]: Start difference. First operand has 2578 states, 2543 states have (on average 1.8387731026346834) internal successors, (4676), 2546 states have internal predecessors, (4676), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-07 00:55:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:34,464 INFO L93 Difference]: Finished difference Result 5292 states and 9690 transitions. [2024-11-07 00:55:34,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:55:34,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 178 [2024-11-07 00:55:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:34,490 INFO L225 Difference]: With dead ends: 5292 [2024-11-07 00:55:34,491 INFO L226 Difference]: Without dead ends: 2653 [2024-11-07 00:55:34,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:55:34,502 INFO L432 NwaCegarLoop]: 4383 mSDtfsCounter, 1051 mSDsluCounter, 12491 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 16874 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:34,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 16874 Invalid, 1092 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 00:55:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2024-11-07 00:55:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2511. [2024-11-07 00:55:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2477 states have (on average 1.8219620508679855) internal successors, (4513), 2479 states have internal predecessors, (4513), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 00:55:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 4565 transitions. [2024-11-07 00:55:34,651 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 4565 transitions. Word has length 178 [2024-11-07 00:55:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:34,652 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 4565 transitions. [2024-11-07 00:55:34,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-07 00:55:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 4565 transitions. [2024-11-07 00:55:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 00:55:34,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:34,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:55:34,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:55:34,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:34,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:34,661 INFO L85 PathProgramCache]: Analyzing trace with hash -170551249, now seen corresponding path program 1 times [2024-11-07 00:55:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:34,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943498458] [2024-11-07 00:55:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:34,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:34,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:34,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:55:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:34,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:55:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:34,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:55:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:34,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:55:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:34,943 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-07 00:55:34,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943498458] [2024-11-07 00:55:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943498458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:34,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:34,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:55:34,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650013256] [2024-11-07 00:55:34,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:34,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:55:34,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:34,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:55:34,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:55:34,947 INFO L87 Difference]: Start difference. First operand 2511 states and 4565 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-07 00:55:36,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:36,816 INFO L93 Difference]: Finished difference Result 3028 states and 5392 transitions. [2024-11-07 00:55:36,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:55:36,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 178 [2024-11-07 00:55:36,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:36,833 INFO L225 Difference]: With dead ends: 3028 [2024-11-07 00:55:36,833 INFO L226 Difference]: Without dead ends: 2653 [2024-11-07 00:55:36,836 INFO L431 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-07 00:55:36,837 INFO L432 NwaCegarLoop]: 4313 mSDtfsCounter, 1037 mSDsluCounter, 12288 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 16601 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:36,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 16601 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 00:55:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2024-11-07 00:55:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2511. [2024-11-07 00:55:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2477 states have (on average 1.821558336697618) internal successors, (4512), 2479 states have internal predecessors, (4512), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 00:55:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 4564 transitions. [2024-11-07 00:55:36,912 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 4564 transitions. Word has length 178 [2024-11-07 00:55:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:36,913 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 4564 transitions. [2024-11-07 00:55:36,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-07 00:55:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 4564 transitions. [2024-11-07 00:55:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 00:55:36,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:36,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:55:36,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:55:36,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:36,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:36,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1574420435, now seen corresponding path program 1 times [2024-11-07 00:55:36,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:36,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297646752] [2024-11-07 00:55:36,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:36,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:37,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:37,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:55:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:37,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:55:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:37,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:55:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:37,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:55:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:37,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:37,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297646752] [2024-11-07 00:55:37,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297646752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:37,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:37,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:55:37,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471813470] [2024-11-07 00:55:37,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:37,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:55:37,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:37,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:55:37,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:55:37,262 INFO L87 Difference]: Start difference. First operand 2511 states and 4564 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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-07 00:55:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:40,431 INFO L93 Difference]: Finished difference Result 3553 states and 6237 transitions. [2024-11-07 00:55:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:55:40,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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 178 [2024-11-07 00:55:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:40,447 INFO L225 Difference]: With dead ends: 3553 [2024-11-07 00:55:40,448 INFO L226 Difference]: Without dead ends: 3183 [2024-11-07 00:55:40,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:55:40,451 INFO L432 NwaCegarLoop]: 4283 mSDtfsCounter, 5530 mSDsluCounter, 12868 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5549 SdHoareTripleChecker+Valid, 17151 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:40,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5549 Valid, 17151 Invalid, 2372 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [108 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:55:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2024-11-07 00:55:40,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 2900. [2024-11-07 00:55:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2838 states have (on average 1.7903453136011276) internal successors, (5081), 2841 states have internal predecessors, (5081), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-11-07 00:55:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 5178 transitions. [2024-11-07 00:55:40,552 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 5178 transitions. Word has length 178 [2024-11-07 00:55:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:40,552 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 5178 transitions. [2024-11-07 00:55:40,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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-07 00:55:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 5178 transitions. [2024-11-07 00:55:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 00:55:40,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:40,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:55:40,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:55:40,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:40,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1844561585, now seen corresponding path program 1 times [2024-11-07 00:55:40,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:40,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584581851] [2024-11-07 00:55:40,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:40,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:40,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:40,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:55:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:55:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:40,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:55:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:40,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:55:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:40,900 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-07 00:55:40,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:40,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584581851] [2024-11-07 00:55:40,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584581851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:40,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:40,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602444452] [2024-11-07 00:55:40,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:40,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:40,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:40,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:40,902 INFO L87 Difference]: Start difference. First operand 2900 states and 5178 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:55:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:44,598 INFO L93 Difference]: Finished difference Result 4492 states and 7737 transitions. [2024-11-07 00:55:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:44,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-07 00:55:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:44,617 INFO L225 Difference]: With dead ends: 4492 [2024-11-07 00:55:44,618 INFO L226 Difference]: Without dead ends: 3733 [2024-11-07 00:55:44,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:44,625 INFO L432 NwaCegarLoop]: 4534 mSDtfsCounter, 5565 mSDsluCounter, 17818 mSDsCounter, 0 mSdLazyCounter, 3582 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5584 SdHoareTripleChecker+Valid, 22352 SdHoareTripleChecker+Invalid, 3643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:44,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5584 Valid, 22352 Invalid, 3643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3582 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 00:55:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2024-11-07 00:55:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3262. [2024-11-07 00:55:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3262 states, 3172 states have (on average 1.764186633039092) internal successors, (5596), 3176 states have internal predecessors, (5596), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-07 00:55:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 5737 transitions. [2024-11-07 00:55:44,742 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 5737 transitions. Word has length 178 [2024-11-07 00:55:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:44,743 INFO L471 AbstractCegarLoop]: Abstraction has 3262 states and 5737 transitions. [2024-11-07 00:55:44,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:55:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 5737 transitions. [2024-11-07 00:55:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 00:55:44,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:44,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:55:44,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:55:44,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:44,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:44,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1233292527, now seen corresponding path program 1 times [2024-11-07 00:55:44,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:44,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273523664] [2024-11-07 00:55:44,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:44,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:44,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:44,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:55:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:55:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:55:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:55:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,094 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-07 00:55:45,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:45,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273523664] [2024-11-07 00:55:45,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273523664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:45,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:45,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:45,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726717722] [2024-11-07 00:55:45,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:45,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:45,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:45,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:45,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:45,098 INFO L87 Difference]: Start difference. First operand 3262 states and 5737 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:55:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:48,282 INFO L93 Difference]: Finished difference Result 5877 states and 9930 transitions. [2024-11-07 00:55:48,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:48,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-07 00:55:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:48,327 INFO L225 Difference]: With dead ends: 5877 [2024-11-07 00:55:48,332 INFO L226 Difference]: Without dead ends: 4756 [2024-11-07 00:55:48,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:48,341 INFO L432 NwaCegarLoop]: 4293 mSDtfsCounter, 5677 mSDsluCounter, 17128 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5696 SdHoareTripleChecker+Valid, 21421 SdHoareTripleChecker+Invalid, 3149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:48,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5696 Valid, 21421 Invalid, 3149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 00:55:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2024-11-07 00:55:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 3987. [2024-11-07 00:55:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3987 states, 3841 states have (on average 1.72533194480604) internal successors, (6627), 3847 states have internal predecessors, (6627), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-07 00:55:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 6860 transitions. [2024-11-07 00:55:48,623 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 6860 transitions. Word has length 178 [2024-11-07 00:55:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:48,624 INFO L471 AbstractCegarLoop]: Abstraction has 3987 states and 6860 transitions. [2024-11-07 00:55:48,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:55:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 6860 transitions. [2024-11-07 00:55:48,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 00:55:48,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:48,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:55:48,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:55:48,627 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:48,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:48,628 INFO L85 PathProgramCache]: Analyzing trace with hash -171899151, now seen corresponding path program 1 times [2024-11-07 00:55:48,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:48,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980871771] [2024-11-07 00:55:48,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:48,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:48,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:55:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:48,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:55:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:48,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:55:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:48,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:55:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:48,911 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-07 00:55:48,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:48,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980871771] [2024-11-07 00:55:48,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980871771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:48,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:48,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:48,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353279958] [2024-11-07 00:55:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:48,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:48,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:48,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:48,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:48,914 INFO L87 Difference]: Start difference. First operand 3987 states and 6860 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:55:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:52,324 INFO L93 Difference]: Finished difference Result 8542 states and 14121 transitions. [2024-11-07 00:55:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:52,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-07 00:55:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:52,357 INFO L225 Difference]: With dead ends: 8542 [2024-11-07 00:55:52,360 INFO L226 Difference]: Without dead ends: 6696 [2024-11-07 00:55:52,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:52,370 INFO L432 NwaCegarLoop]: 4532 mSDtfsCounter, 5563 mSDsluCounter, 17818 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5582 SdHoareTripleChecker+Valid, 22350 SdHoareTripleChecker+Invalid, 3634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:52,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5582 Valid, 22350 Invalid, 3634 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3571 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:55:52,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6696 states. [2024-11-07 00:55:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6696 to 5438. [2024-11-07 00:55:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5438 states, 5180 states have (on average 1.6774131274131274) internal successors, (8689), 5190 states have internal predecessors, (8689), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-07 00:55:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5438 states to 5438 states and 9112 transitions. [2024-11-07 00:55:52,712 INFO L78 Accepts]: Start accepts. Automaton has 5438 states and 9112 transitions. Word has length 178 [2024-11-07 00:55:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:52,713 INFO L471 AbstractCegarLoop]: Abstraction has 5438 states and 9112 transitions. [2024-11-07 00:55:52,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:55:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 5438 states and 9112 transitions. [2024-11-07 00:55:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 00:55:52,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:52,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:55:52,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:55:52,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:52,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1722434735, now seen corresponding path program 1 times [2024-11-07 00:55:52,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:52,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003704765] [2024-11-07 00:55:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:52,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:52,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:53,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:55:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:53,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:55:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:53,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:55:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:53,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:55:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:53,333 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-07 00:55:53,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003704765] [2024-11-07 00:55:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003704765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:53,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:53,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:53,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418617974] [2024-11-07 00:55:53,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:53,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:53,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:53,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:53,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:53,336 INFO L87 Difference]: Start difference. First operand 5438 states and 9112 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:55:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:56,925 INFO L93 Difference]: Finished difference Result 13864 states and 22507 transitions. [2024-11-07 00:55:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:56,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-07 00:55:56,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:57,003 INFO L225 Difference]: With dead ends: 13864 [2024-11-07 00:55:57,003 INFO L226 Difference]: Without dead ends: 10567 [2024-11-07 00:55:57,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:57,023 INFO L432 NwaCegarLoop]: 4532 mSDtfsCounter, 5559 mSDsluCounter, 17818 mSDsCounter, 0 mSdLazyCounter, 3543 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5578 SdHoareTripleChecker+Valid, 22350 SdHoareTripleChecker+Invalid, 3606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:57,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5578 Valid, 22350 Invalid, 3606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3543 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 00:55:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10567 states. [2024-11-07 00:55:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10567 to 8354. [2024-11-07 00:55:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8354 states, 7872 states have (on average 1.630716463414634) internal successors, (12837), 7890 states have internal predecessors, (12837), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-07 00:55:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8354 states to 8354 states and 13658 transitions. [2024-11-07 00:55:57,564 INFO L78 Accepts]: Start accepts. Automaton has 8354 states and 13658 transitions. Word has length 178 [2024-11-07 00:55:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:57,567 INFO L471 AbstractCegarLoop]: Abstraction has 8354 states and 13658 transitions. [2024-11-07 00:55:57,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:55:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 8354 states and 13658 transitions. [2024-11-07 00:55:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 00:55:57,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:57,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:55:57,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:55:57,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:57,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash 799267309, now seen corresponding path program 1 times [2024-11-07 00:55:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:57,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077822330] [2024-11-07 00:55:57,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:57,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:57,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:55:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:57,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:55:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:57,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:55:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:57,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:55:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:57,860 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-07 00:55:57,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:57,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077822330] [2024-11-07 00:55:57,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077822330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:57,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:57,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775171510] [2024-11-07 00:55:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:57,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:57,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:57,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:57,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:57,862 INFO L87 Difference]: Start difference. First operand 8354 states and 13658 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:56:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:01,802 INFO L93 Difference]: Finished difference Result 24526 states and 39371 transitions. [2024-11-07 00:56:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:56:01,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-07 00:56:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:01,870 INFO L225 Difference]: With dead ends: 24526 [2024-11-07 00:56:01,871 INFO L226 Difference]: Without dead ends: 18313 [2024-11-07 00:56:01,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:56:01,894 INFO L432 NwaCegarLoop]: 4532 mSDtfsCounter, 5558 mSDsluCounter, 17818 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5577 SdHoareTripleChecker+Valid, 22350 SdHoareTripleChecker+Invalid, 3593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:01,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5577 Valid, 22350 Invalid, 3593 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3530 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 00:56:01,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18313 states. [2024-11-07 00:56:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18313 to 14199. [2024-11-07 00:56:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14199 states, 13269 states have (on average 1.5940161278167158) internal successors, (21151), 13303 states have internal predecessors, (21151), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-07 00:56:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14199 states to 14199 states and 22822 transitions. [2024-11-07 00:56:02,686 INFO L78 Accepts]: Start accepts. Automaton has 14199 states and 22822 transitions. Word has length 178 [2024-11-07 00:56:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:02,687 INFO L471 AbstractCegarLoop]: Abstraction has 14199 states and 22822 transitions. [2024-11-07 00:56:02,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:56:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 14199 states and 22822 transitions. [2024-11-07 00:56:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 00:56:02,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:02,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:56:02,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:56:02,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:02,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:02,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1185129711, now seen corresponding path program 1 times [2024-11-07 00:56:02,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:02,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432181048] [2024-11-07 00:56:02,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:02,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:02,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:03,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:56:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:03,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:56:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:03,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:56:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:03,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:56:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:03,390 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-07 00:56:03,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432181048] [2024-11-07 00:56:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432181048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:03,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:03,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:03,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594865223] [2024-11-07 00:56:03,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:03,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:03,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:03,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:03,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:03,394 INFO L87 Difference]: Start difference. First operand 14199 states and 22822 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:56:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:06,236 INFO L93 Difference]: Finished difference Result 30624 states and 49244 transitions. [2024-11-07 00:56:06,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:56:06,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-07 00:56:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:06,314 INFO L225 Difference]: With dead ends: 30624 [2024-11-07 00:56:06,315 INFO L226 Difference]: Without dead ends: 18566 [2024-11-07 00:56:06,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:56:06,354 INFO L432 NwaCegarLoop]: 4268 mSDtfsCounter, 5111 mSDsluCounter, 16812 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5131 SdHoareTripleChecker+Valid, 21080 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:06,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5131 Valid, 21080 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 00:56:06,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18566 states. [2024-11-07 00:56:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18566 to 14199. [2024-11-07 00:56:07,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14199 states, 13269 states have (on average 1.5915291280428066) internal successors, (21118), 13303 states have internal predecessors, (21118), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-07 00:56:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14199 states to 14199 states and 22789 transitions. [2024-11-07 00:56:07,202 INFO L78 Accepts]: Start accepts. Automaton has 14199 states and 22789 transitions. Word has length 178 [2024-11-07 00:56:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:07,203 INFO L471 AbstractCegarLoop]: Abstraction has 14199 states and 22789 transitions. [2024-11-07 00:56:07,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:56:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 14199 states and 22789 transitions. [2024-11-07 00:56:07,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 00:56:07,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:07,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:56:07,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:56:07,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:07,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:07,218 INFO L85 PathProgramCache]: Analyzing trace with hash 920482221, now seen corresponding path program 1 times [2024-11-07 00:56:07,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:07,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744193389] [2024-11-07 00:56:07,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:07,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:07,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:07,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:56:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:07,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:56:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:07,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:56:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:07,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:56:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:07,601 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-07 00:56:07,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:07,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744193389] [2024-11-07 00:56:07,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744193389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:07,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:07,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:07,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287545893] [2024-11-07 00:56:07,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:07,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:07,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:07,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:07,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:07,603 INFO L87 Difference]: Start difference. First operand 14199 states and 22789 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:56:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:11,989 INFO L93 Difference]: Finished difference Result 45815 states and 73057 transitions. [2024-11-07 00:56:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:56:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-07 00:56:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:12,115 INFO L225 Difference]: With dead ends: 45815 [2024-11-07 00:56:12,116 INFO L226 Difference]: Without dead ends: 33757 [2024-11-07 00:56:12,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:56:12,157 INFO L432 NwaCegarLoop]: 4532 mSDtfsCounter, 5550 mSDsluCounter, 17818 mSDsCounter, 0 mSdLazyCounter, 3492 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5569 SdHoareTripleChecker+Valid, 22350 SdHoareTripleChecker+Invalid, 3555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:12,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5569 Valid, 22350 Invalid, 3555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3492 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:56:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33757 states. [2024-11-07 00:56:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33757 to 25953. [2024-11-07 00:56:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25953 states, 24127 states have (on average 1.5664608115389398) internal successors, (37794), 24193 states have internal predecessors, (37794), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-11-07 00:56:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25953 states to 25953 states and 41327 transitions. [2024-11-07 00:56:13,503 INFO L78 Accepts]: Start accepts. Automaton has 25953 states and 41327 transitions. Word has length 178 [2024-11-07 00:56:13,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:13,504 INFO L471 AbstractCegarLoop]: Abstraction has 25953 states and 41327 transitions. [2024-11-07 00:56:13,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:56:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 25953 states and 41327 transitions. [2024-11-07 00:56:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 00:56:13,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:13,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:56:13,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:56:13,518 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:13,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:13,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1443359441, now seen corresponding path program 1 times [2024-11-07 00:56:13,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:13,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100525374] [2024-11-07 00:56:13,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:13,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:13,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:13,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:56:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:13,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:56:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:13,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:56:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:13,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:56:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:13,774 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-07 00:56:13,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:13,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100525374] [2024-11-07 00:56:13,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100525374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:13,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:13,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:13,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713586934] [2024-11-07 00:56:13,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:13,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:13,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:13,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:13,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:13,776 INFO L87 Difference]: Start difference. First operand 25953 states and 41327 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:56:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:19,437 INFO L93 Difference]: Finished difference Result 88463 states and 141305 transitions. [2024-11-07 00:56:19,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:56:19,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-07 00:56:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:19,691 INFO L225 Difference]: With dead ends: 88463 [2024-11-07 00:56:19,691 INFO L226 Difference]: Without dead ends: 64651 [2024-11-07 00:56:19,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:56:19,774 INFO L432 NwaCegarLoop]: 4532 mSDtfsCounter, 5549 mSDsluCounter, 17818 mSDsCounter, 0 mSdLazyCounter, 3479 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5568 SdHoareTripleChecker+Valid, 22350 SdHoareTripleChecker+Invalid, 3542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:19,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5568 Valid, 22350 Invalid, 3542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3479 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:56:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64651 states. [2024-11-07 00:56:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64651 to 49522. [2024-11-07 00:56:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49522 states, 45904 states have (on average 1.5518473335657024) internal successors, (71236), 46034 states have internal predecessors, (71236), 2714 states have call successors, (2714), 774 states have call predecessors, (2714), 902 states have return successors, (5029), 2841 states have call predecessors, (5029), 2714 states have call successors, (5029) [2024-11-07 00:56:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49522 states to 49522 states and 78979 transitions. [2024-11-07 00:56:22,544 INFO L78 Accepts]: Start accepts. Automaton has 49522 states and 78979 transitions. Word has length 178 [2024-11-07 00:56:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:22,545 INFO L471 AbstractCegarLoop]: Abstraction has 49522 states and 78979 transitions. [2024-11-07 00:56:22,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-07 00:56:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 49522 states and 78979 transitions. [2024-11-07 00:56:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 00:56:22,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:22,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:56:22,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:56:22,576 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:22,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:22,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1528428909, now seen corresponding path program 1 times [2024-11-07 00:56:22,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:22,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817245618] [2024-11-07 00:56:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:22,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:22,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:56:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:22,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:56:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:22,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:56:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:22,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:56:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:22,895 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-07 00:56:22,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:22,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817245618] [2024-11-07 00:56:22,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817245618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:22,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:22,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:22,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322183550] [2024-11-07 00:56:22,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:22,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:22,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:22,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:22,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:22,898 INFO L87 Difference]: Start difference. First operand 49522 states and 78979 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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)