./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.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/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.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', 'e22fd4a52371acb4b873b206639f8f51f7518d2778c43044aaff0b323ebca998'] 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/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.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 e22fd4a52371acb4b873b206639f8f51f7518d2778c43044aaff0b323ebca998 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:21:33,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:21:33,179 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:21:33,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:21:33,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:21:33,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:21:33,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:21:33,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:21:33,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:21:33,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:21:33,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:21:33,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:21:33,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:21:33,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:21:33,224 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:21:33,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:21:33,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:21:33,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:21:33,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:21:33,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:21:33,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:21:33,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:21:33,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:21:33,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:21:33,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:21:33,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:21:33,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:21:33,225 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:21:33,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:21:33,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:21:33,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:21:33,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:21:33,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:21:33,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:21:33,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:21:33,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:21:33,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:21:33,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:21:33,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:21:33,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:21:33,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:21:33,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:21:33,227 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 -> e22fd4a52371acb4b873b206639f8f51f7518d2778c43044aaff0b323ebca998 [2024-11-07 00:21:33,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:21:33,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:21:33,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:21:33,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:21:33,548 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:21:33,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-11-07 00:21:34,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:21:35,329 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:21:35,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-11-07 00:21:35,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb6c7826a/5be0e1967d7441f6a4373cd053cf6e68/FLAGfb0cfb62a [2024-11-07 00:21:35,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb6c7826a/5be0e1967d7441f6a4373cd053cf6e68 [2024-11-07 00:21:35,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:21:35,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:21:35,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:21:35,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:21:35,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:21:35,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:21:35" (1/1) ... [2024-11-07 00:21:35,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b94bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:35, skipping insertion in model container [2024-11-07 00:21:35,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:21:35" (1/1) ... [2024-11-07 00:21:35,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:21:35,926 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/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[22084,22097] [2024-11-07 00:21:36,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:21:36,127 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:21:36,257 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/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[22084,22097] [2024-11-07 00:21:36,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:21:36,359 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:21:36,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:36 WrapperNode [2024-11-07 00:21:36,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:21:36,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:21:36,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:21:36,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:21:36,366 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:21:36" (1/1) ... [2024-11-07 00:21:36,389 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:21:36" (1/1) ... [2024-11-07 00:21:36,508 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2876 [2024-11-07 00:21:36,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:21:36,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:21:36,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:21:36,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:21:36,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:36" (1/1) ... [2024-11-07 00:21:36,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:36" (1/1) ... [2024-11-07 00:21:36,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:36" (1/1) ... [2024-11-07 00:21:36,579 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:21:36,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:36" (1/1) ... [2024-11-07 00:21:36,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:36" (1/1) ... [2024-11-07 00:21:36,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:36" (1/1) ... [2024-11-07 00:21:36,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:36" (1/1) ... [2024-11-07 00:21:36,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:36" (1/1) ... [2024-11-07 00:21:36,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:36" (1/1) ... [2024-11-07 00:21:36,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:21:36,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:21:36,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:21:36,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:21:36,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:36" (1/1) ... [2024-11-07 00:21:36,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:21:36,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:21:36,832 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:21:36,836 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:21:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:21:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:21:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:21:36,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:21:37,097 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:21:37,099 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:21:39,803 INFO L? ?]: Removed 252 outVars from TransFormulas that were not future-live. [2024-11-07 00:21:39,803 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:21:39,857 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:21:39,857 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:21:39,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:21:39 BoogieIcfgContainer [2024-11-07 00:21:39,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:21:39,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:21:39,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:21:39,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:21:39,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:21:35" (1/3) ... [2024-11-07 00:21:39,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f850e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:21:39, skipping insertion in model container [2024-11-07 00:21:39,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:36" (2/3) ... [2024-11-07 00:21:39,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f850e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:21:39, skipping insertion in model container [2024-11-07 00:21:39,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:21:39" (3/3) ... [2024-11-07 00:21:39,871 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-11-07 00:21:39,885 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:21:39,886 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:21:39,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:21:39,988 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;@318d660c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:21:39,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:21:40,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 736 states, 734 states have (on average 1.8419618528610355) internal successors, (1352), 735 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:40,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 00:21:40,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:40,033 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, 1, 1, 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:21:40,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:40,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash -666845715, now seen corresponding path program 1 times [2024-11-07 00:21:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:40,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810149282] [2024-11-07 00:21:40,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:40,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:41,187 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:21:41,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:41,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810149282] [2024-11-07 00:21:41,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810149282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:41,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:41,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:21:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427990880] [2024-11-07 00:21:41,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:41,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:21:41,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:41,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:21:41,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:41,228 INFO L87 Difference]: Start difference. First operand has 736 states, 734 states have (on average 1.8419618528610355) internal successors, (1352), 735 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:41,419 INFO L93 Difference]: Finished difference Result 1109 states and 1983 transitions. [2024-11-07 00:21:41,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:21:41,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2024-11-07 00:21:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:41,447 INFO L225 Difference]: With dead ends: 1109 [2024-11-07 00:21:41,447 INFO L226 Difference]: Without dead ends: 910 [2024-11-07 00:21:41,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:41,459 INFO L432 NwaCegarLoop]: 1352 mSDtfsCounter, 339 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:41,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 2596 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:21:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-07 00:21:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 908. [2024-11-07 00:21:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 1.7420066152149944) internal successors, (1580), 907 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1580 transitions. [2024-11-07 00:21:41,576 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1580 transitions. Word has length 204 [2024-11-07 00:21:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:41,579 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1580 transitions. [2024-11-07 00:21:41,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1580 transitions. [2024-11-07 00:21:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 00:21:41,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:41,590 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, 1, 1, 1, 1, 1, 1, 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:21:41,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:21:41,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:41,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:41,591 INFO L85 PathProgramCache]: Analyzing trace with hash 961374666, now seen corresponding path program 1 times [2024-11-07 00:21:41,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:41,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852336486] [2024-11-07 00:21:41,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:41,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:42,108 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:21:42,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:42,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852336486] [2024-11-07 00:21:42,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852336486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:42,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:42,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:21:42,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122623025] [2024-11-07 00:21:42,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:42,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:21:42,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:42,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:21:42,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:42,117 INFO L87 Difference]: Start difference. First operand 908 states and 1580 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:42,194 INFO L93 Difference]: Finished difference Result 1616 states and 2772 transitions. [2024-11-07 00:21:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:21:42,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2024-11-07 00:21:42,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:42,205 INFO L225 Difference]: With dead ends: 1616 [2024-11-07 00:21:42,207 INFO L226 Difference]: Without dead ends: 1251 [2024-11-07 00:21:42,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:42,213 INFO L432 NwaCegarLoop]: 1493 mSDtfsCounter, 292 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:42,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 2728 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:21:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-11-07 00:21:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1249. [2024-11-07 00:21:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.7243589743589745) internal successors, (2152), 1248 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 2152 transitions. [2024-11-07 00:21:42,264 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 2152 transitions. Word has length 208 [2024-11-07 00:21:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:42,265 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 2152 transitions. [2024-11-07 00:21:42,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 2152 transitions. [2024-11-07 00:21:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 00:21:42,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:42,271 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:42,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:21:42,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:42,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1204290054, now seen corresponding path program 1 times [2024-11-07 00:21:42,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:42,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637897893] [2024-11-07 00:21:42,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:42,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:42,674 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:21:42,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:42,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637897893] [2024-11-07 00:21:42,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637897893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:42,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:42,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:21:42,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943074328] [2024-11-07 00:21:42,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:42,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:21:42,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:42,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:21:42,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:42,680 INFO L87 Difference]: Start difference. First operand 1249 states and 2152 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:42,749 INFO L93 Difference]: Finished difference Result 1950 states and 3336 transitions. [2024-11-07 00:21:42,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:21:42,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2024-11-07 00:21:42,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:42,762 INFO L225 Difference]: With dead ends: 1950 [2024-11-07 00:21:42,762 INFO L226 Difference]: Without dead ends: 1585 [2024-11-07 00:21:42,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:42,766 INFO L432 NwaCegarLoop]: 1494 mSDtfsCounter, 293 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 2736 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:42,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 2736 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:21:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-11-07 00:21:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1583. [2024-11-07 00:21:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1582 states have (on average 1.715549936788875) internal successors, (2714), 1582 states have internal predecessors, (2714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2714 transitions. [2024-11-07 00:21:42,819 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2714 transitions. Word has length 212 [2024-11-07 00:21:42,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:42,820 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2714 transitions. [2024-11-07 00:21:42,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2714 transitions. [2024-11-07 00:21:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 00:21:42,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:42,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:42,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:21:42,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:42,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash -640806259, now seen corresponding path program 1 times [2024-11-07 00:21:42,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:42,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513453033] [2024-11-07 00:21:42,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:42,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:43,250 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:21:43,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:43,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513453033] [2024-11-07 00:21:43,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513453033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:43,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:43,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:21:43,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776951404] [2024-11-07 00:21:43,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:43,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:21:43,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:43,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:21:43,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:43,257 INFO L87 Difference]: Start difference. First operand 1583 states and 2714 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:43,417 INFO L93 Difference]: Finished difference Result 3523 states and 5970 transitions. [2024-11-07 00:21:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:21:43,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2024-11-07 00:21:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:43,432 INFO L225 Difference]: With dead ends: 3523 [2024-11-07 00:21:43,432 INFO L226 Difference]: Without dead ends: 2520 [2024-11-07 00:21:43,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:43,438 INFO L432 NwaCegarLoop]: 1286 mSDtfsCounter, 285 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:43,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 2522 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:21:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2024-11-07 00:21:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2518. [2024-11-07 00:21:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2517 states have (on average 1.697258641239571) internal successors, (4272), 2517 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 4272 transitions. [2024-11-07 00:21:43,549 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 4272 transitions. Word has length 212 [2024-11-07 00:21:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:43,550 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 4272 transitions. [2024-11-07 00:21:43,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 4272 transitions. [2024-11-07 00:21:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-07 00:21:43,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:43,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:21:43,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:43,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1656526890, now seen corresponding path program 1 times [2024-11-07 00:21:43,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:43,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238882765] [2024-11-07 00:21:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:43,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:43,888 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:21:43,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:43,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238882765] [2024-11-07 00:21:43,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238882765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:43,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:43,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:21:43,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713543404] [2024-11-07 00:21:43,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:43,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:21:43,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:43,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:21:43,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:43,892 INFO L87 Difference]: Start difference. First operand 2518 states and 4272 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:44,048 INFO L93 Difference]: Finished difference Result 6262 states and 10518 transitions. [2024-11-07 00:21:44,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:21:44,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2024-11-07 00:21:44,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:44,069 INFO L225 Difference]: With dead ends: 6262 [2024-11-07 00:21:44,069 INFO L226 Difference]: Without dead ends: 4324 [2024-11-07 00:21:44,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:44,078 INFO L432 NwaCegarLoop]: 1401 mSDtfsCounter, 278 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:44,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 2638 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:21:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4324 states. [2024-11-07 00:21:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4324 to 4322. [2024-11-07 00:21:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4322 states, 4321 states have (on average 1.6792409164545243) internal successors, (7256), 4321 states have internal predecessors, (7256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4322 states to 4322 states and 7256 transitions. [2024-11-07 00:21:44,207 INFO L78 Accepts]: Start accepts. Automaton has 4322 states and 7256 transitions. Word has length 216 [2024-11-07 00:21:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:44,207 INFO L471 AbstractCegarLoop]: Abstraction has 4322 states and 7256 transitions. [2024-11-07 00:21:44,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4322 states and 7256 transitions. [2024-11-07 00:21:44,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-07 00:21:44,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:44,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:44,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:21:44,212 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:44,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:44,213 INFO L85 PathProgramCache]: Analyzing trace with hash -759647818, now seen corresponding path program 1 times [2024-11-07 00:21:44,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:44,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482012780] [2024-11-07 00:21:44,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:44,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:44,514 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:21:44,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:44,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482012780] [2024-11-07 00:21:44,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482012780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:44,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:44,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:21:44,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809721923] [2024-11-07 00:21:44,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:44,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:21:44,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:44,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:21:44,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:44,516 INFO L87 Difference]: Start difference. First operand 4322 states and 7256 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:44,633 INFO L93 Difference]: Finished difference Result 7918 states and 13272 transitions. [2024-11-07 00:21:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:21:44,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-11-07 00:21:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:44,665 INFO L225 Difference]: With dead ends: 7918 [2024-11-07 00:21:44,666 INFO L226 Difference]: Without dead ends: 5980 [2024-11-07 00:21:44,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:44,674 INFO L432 NwaCegarLoop]: 1401 mSDtfsCounter, 279 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:44,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 2645 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:21:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2024-11-07 00:21:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 5978. [2024-11-07 00:21:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5978 states, 5977 states have (on average 1.674083988623055) internal successors, (10006), 5977 states have internal predecessors, (10006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5978 states to 5978 states and 10006 transitions. [2024-11-07 00:21:44,850 INFO L78 Accepts]: Start accepts. Automaton has 5978 states and 10006 transitions. Word has length 220 [2024-11-07 00:21:44,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:44,851 INFO L471 AbstractCegarLoop]: Abstraction has 5978 states and 10006 transitions. [2024-11-07 00:21:44,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5978 states and 10006 transitions. [2024-11-07 00:21:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-07 00:21:44,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:44,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:44,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:21:44,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:44,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash -808960211, now seen corresponding path program 1 times [2024-11-07 00:21:44,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:44,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887991755] [2024-11-07 00:21:44,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:44,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:45,203 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:21:45,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:45,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887991755] [2024-11-07 00:21:45,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887991755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:45,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:45,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:21:45,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666662596] [2024-11-07 00:21:45,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:45,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:21:45,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:45,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:21:45,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:45,208 INFO L87 Difference]: Start difference. First operand 5978 states and 10006 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:45,413 INFO L93 Difference]: Finished difference Result 16146 states and 26844 transitions. [2024-11-07 00:21:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:21:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-11-07 00:21:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:45,466 INFO L225 Difference]: With dead ends: 16146 [2024-11-07 00:21:45,466 INFO L226 Difference]: Without dead ends: 10864 [2024-11-07 00:21:45,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:45,480 INFO L432 NwaCegarLoop]: 1287 mSDtfsCounter, 271 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:45,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 2525 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:21:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10864 states. [2024-11-07 00:21:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10864 to 10862. [2024-11-07 00:21:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10862 states, 10861 states have (on average 1.658226682625909) internal successors, (18010), 10861 states have internal predecessors, (18010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10862 states to 10862 states and 18010 transitions. [2024-11-07 00:21:45,810 INFO L78 Accepts]: Start accepts. Automaton has 10862 states and 18010 transitions. Word has length 220 [2024-11-07 00:21:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:45,811 INFO L471 AbstractCegarLoop]: Abstraction has 10862 states and 18010 transitions. [2024-11-07 00:21:45,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 10862 states and 18010 transitions. [2024-11-07 00:21:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-07 00:21:45,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:45,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:45,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:21:45,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:45,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1627459958, now seen corresponding path program 1 times [2024-11-07 00:21:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:45,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717080230] [2024-11-07 00:21:45,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:45,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:46,393 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:21:46,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:46,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717080230] [2024-11-07 00:21:46,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717080230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:46,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:46,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:21:46,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698642590] [2024-11-07 00:21:46,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:46,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:21:46,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:46,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:21:46,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:21:46,396 INFO L87 Difference]: Start difference. First operand 10862 states and 18010 transitions. Second operand has 7 states, 7 states have (on average 32.0) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:47,447 INFO L93 Difference]: Finished difference Result 73998 states and 123151 transitions. [2024-11-07 00:21:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 00:21:47,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.0) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2024-11-07 00:21:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:47,662 INFO L225 Difference]: With dead ends: 73998 [2024-11-07 00:21:47,662 INFO L226 Difference]: Without dead ends: 63832 [2024-11-07 00:21:47,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-07 00:21:47,700 INFO L432 NwaCegarLoop]: 1273 mSDtfsCounter, 4553 mSDsluCounter, 9084 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4553 SdHoareTripleChecker+Valid, 10357 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:47,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4553 Valid, 10357 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:21:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63832 states. [2024-11-07 00:21:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63832 to 20817. [2024-11-07 00:21:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20817 states, 20816 states have (on average 1.6534877017678709) internal successors, (34419), 20816 states have internal predecessors, (34419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20817 states to 20817 states and 34419 transitions. [2024-11-07 00:21:48,942 INFO L78 Accepts]: Start accepts. Automaton has 20817 states and 34419 transitions. Word has length 224 [2024-11-07 00:21:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:48,943 INFO L471 AbstractCegarLoop]: Abstraction has 20817 states and 34419 transitions. [2024-11-07 00:21:48,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.0) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 20817 states and 34419 transitions. [2024-11-07 00:21:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-07 00:21:48,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:48,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:48,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:21:48,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:48,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:48,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1016729105, now seen corresponding path program 1 times [2024-11-07 00:21:48,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:48,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632736381] [2024-11-07 00:21:48,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:48,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:49,261 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:21:49,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:49,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632736381] [2024-11-07 00:21:49,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632736381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:49,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:49,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:21:49,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568194118] [2024-11-07 00:21:49,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:49,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:21:49,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:49,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:21:49,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:21:49,263 INFO L87 Difference]: Start difference. First operand 20817 states and 34419 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:49,649 INFO L93 Difference]: Finished difference Result 61920 states and 102779 transitions. [2024-11-07 00:21:49,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:21:49,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-07 00:21:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:49,780 INFO L225 Difference]: With dead ends: 61920 [2024-11-07 00:21:49,781 INFO L226 Difference]: Without dead ends: 41861 [2024-11-07 00:21:49,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:21:49,946 INFO L432 NwaCegarLoop]: 1275 mSDtfsCounter, 939 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 3902 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:49,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 3902 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:21:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41861 states. [2024-11-07 00:21:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41861 to 31296. [2024-11-07 00:21:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31296 states, 31295 states have (on average 1.655376258188209) internal successors, (51805), 31295 states have internal predecessors, (51805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31296 states to 31296 states and 51805 transitions. [2024-11-07 00:21:50,815 INFO L78 Accepts]: Start accepts. Automaton has 31296 states and 51805 transitions. Word has length 225 [2024-11-07 00:21:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:50,815 INFO L471 AbstractCegarLoop]: Abstraction has 31296 states and 51805 transitions. [2024-11-07 00:21:50,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 31296 states and 51805 transitions. [2024-11-07 00:21:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-07 00:21:50,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:50,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:50,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:21:50,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:50,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:50,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1804910714, now seen corresponding path program 1 times [2024-11-07 00:21:50,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:50,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978620721] [2024-11-07 00:21:50,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:50,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:51,071 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:21:51,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:51,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978620721] [2024-11-07 00:21:51,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978620721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:51,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:51,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:21:51,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481015855] [2024-11-07 00:21:51,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:51,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:21:51,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:51,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:21:51,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:51,077 INFO L87 Difference]: Start difference. First operand 31296 states and 51805 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:51,672 INFO L93 Difference]: Finished difference Result 59898 states and 99327 transitions. [2024-11-07 00:21:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:21:51,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-07 00:21:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:51,808 INFO L225 Difference]: With dead ends: 59898 [2024-11-07 00:21:51,808 INFO L226 Difference]: Without dead ends: 43930 [2024-11-07 00:21:51,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:51,855 INFO L432 NwaCegarLoop]: 1367 mSDtfsCounter, 272 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:51,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 2612 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:21:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43930 states. [2024-11-07 00:21:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43930 to 43928. [2024-11-07 00:21:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43928 states, 43927 states have (on average 1.6528103444350855) internal successors, (72603), 43927 states have internal predecessors, (72603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43928 states to 43928 states and 72603 transitions. [2024-11-07 00:21:52,753 INFO L78 Accepts]: Start accepts. Automaton has 43928 states and 72603 transitions. Word has length 225 [2024-11-07 00:21:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:52,756 INFO L471 AbstractCegarLoop]: Abstraction has 43928 states and 72603 transitions. [2024-11-07 00:21:52,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 43928 states and 72603 transitions. [2024-11-07 00:21:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-07 00:21:52,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:52,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:52,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:21:52,762 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:52,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:52,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1252454586, now seen corresponding path program 1 times [2024-11-07 00:21:52,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:52,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619724789] [2024-11-07 00:21:52,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:53,162 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:21:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619724789] [2024-11-07 00:21:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619724789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:53,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:21:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002777443] [2024-11-07 00:21:53,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:53,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:21:53,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:53,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:21:53,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:53,165 INFO L87 Difference]: Start difference. First operand 43928 states and 72603 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:53,720 INFO L93 Difference]: Finished difference Result 83514 states and 138377 transitions. [2024-11-07 00:21:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:21:53,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-07 00:21:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:53,902 INFO L225 Difference]: With dead ends: 83514 [2024-11-07 00:21:53,903 INFO L226 Difference]: Without dead ends: 60858 [2024-11-07 00:21:53,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:53,931 INFO L432 NwaCegarLoop]: 1459 mSDtfsCounter, 286 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:53,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 2702 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:21:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60858 states. [2024-11-07 00:21:54,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60858 to 60856. [2024-11-07 00:21:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60856 states, 60855 states have (on average 1.651220113384274) internal successors, (100485), 60855 states have internal predecessors, (100485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60856 states to 60856 states and 100485 transitions. [2024-11-07 00:21:54,867 INFO L78 Accepts]: Start accepts. Automaton has 60856 states and 100485 transitions. Word has length 225 [2024-11-07 00:21:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:54,867 INFO L471 AbstractCegarLoop]: Abstraction has 60856 states and 100485 transitions. [2024-11-07 00:21:54,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 60856 states and 100485 transitions. [2024-11-07 00:21:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-07 00:21:54,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:54,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:54,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:21:54,873 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:54,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:54,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1749864198, now seen corresponding path program 1 times [2024-11-07 00:21:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:54,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525465643] [2024-11-07 00:21:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:55,117 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:21:55,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525465643] [2024-11-07 00:21:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525465643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:55,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:55,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:21:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108077654] [2024-11-07 00:21:55,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:55,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:21:55,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:21:55,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:55,120 INFO L87 Difference]: Start difference. First operand 60856 states and 100485 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:55,791 INFO L93 Difference]: Finished difference Result 133560 states and 221685 transitions. [2024-11-07 00:21:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:21:55,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-07 00:21:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:56,291 INFO L225 Difference]: With dead ends: 133560 [2024-11-07 00:21:56,292 INFO L226 Difference]: Without dead ends: 91736 [2024-11-07 00:21:56,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:21:56,337 INFO L432 NwaCegarLoop]: 1542 mSDtfsCounter, 300 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:56,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 2783 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:21:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91736 states. [2024-11-07 00:21:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91736 to 91734. [2024-11-07 00:21:57,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91734 states, 91733 states have (on average 1.6519246072841836) internal successors, (151536), 91733 states have internal predecessors, (151536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91734 states to 91734 states and 151536 transitions. [2024-11-07 00:21:57,725 INFO L78 Accepts]: Start accepts. Automaton has 91734 states and 151536 transitions. Word has length 225 [2024-11-07 00:21:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:57,726 INFO L471 AbstractCegarLoop]: Abstraction has 91734 states and 151536 transitions. [2024-11-07 00:21:57,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 91734 states and 151536 transitions. [2024-11-07 00:21:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-07 00:21:57,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:57,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:57,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:21:57,730 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:57,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1386769457, now seen corresponding path program 1 times [2024-11-07 00:21:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954639795] [2024-11-07 00:21:57,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:58,309 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:21:58,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:58,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954639795] [2024-11-07 00:21:58,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954639795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:58,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:58,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:21:58,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689891999] [2024-11-07 00:21:58,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:58,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:21:58,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:58,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:21:58,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:21:58,311 INFO L87 Difference]: Start difference. First operand 91734 states and 151536 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:21:59,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:59,561 INFO L93 Difference]: Finished difference Result 301365 states and 498659 transitions. [2024-11-07 00:21:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:21:59,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2024-11-07 00:21:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:00,318 INFO L225 Difference]: With dead ends: 301365 [2024-11-07 00:22:00,318 INFO L226 Difference]: Without dead ends: 210268 [2024-11-07 00:22:00,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:22:00,416 INFO L432 NwaCegarLoop]: 1283 mSDtfsCounter, 937 mSDsluCounter, 2831 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 4114 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:00,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 4114 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:22:00,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210268 states. [2024-11-07 00:22:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210268 to 150732. [2024-11-07 00:22:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150732 states, 150731 states have (on average 1.648937511195441) internal successors, (248546), 150731 states have internal predecessors, (248546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150732 states to 150732 states and 248546 transitions. [2024-11-07 00:22:03,295 INFO L78 Accepts]: Start accepts. Automaton has 150732 states and 248546 transitions. Word has length 226 [2024-11-07 00:22:03,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:03,296 INFO L471 AbstractCegarLoop]: Abstraction has 150732 states and 248546 transitions. [2024-11-07 00:22:03,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:03,297 INFO L276 IsEmpty]: Start isEmpty. Operand 150732 states and 248546 transitions. [2024-11-07 00:22:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-07 00:22:03,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:03,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:03,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:22:03,300 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:22:03,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:03,300 INFO L85 PathProgramCache]: Analyzing trace with hash -22323496, now seen corresponding path program 1 times [2024-11-07 00:22:03,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:03,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719281535] [2024-11-07 00:22:03,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:03,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:03,616 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:22:03,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:03,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719281535] [2024-11-07 00:22:03,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719281535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:03,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:03,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:22:03,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881055959] [2024-11-07 00:22:03,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:03,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:22:03,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:03,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:22:03,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:22:03,619 INFO L87 Difference]: Start difference. First operand 150732 states and 248546 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:05,616 INFO L93 Difference]: Finished difference Result 494901 states and 817523 transitions. [2024-11-07 00:22:05,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:22:05,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2024-11-07 00:22:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:06,771 INFO L225 Difference]: With dead ends: 494901 [2024-11-07 00:22:06,771 INFO L226 Difference]: Without dead ends: 344806 [2024-11-07 00:22:06,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:22:06,898 INFO L432 NwaCegarLoop]: 1276 mSDtfsCounter, 935 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 4109 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:06,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 4109 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:22:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344806 states. [2024-11-07 00:22:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344806 to 247326. [2024-11-07 00:22:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247326 states, 247325 states have (on average 1.6460446780551905) internal successors, (407108), 247325 states have internal predecessors, (407108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247326 states to 247326 states and 407108 transitions. [2024-11-07 00:22:11,233 INFO L78 Accepts]: Start accepts. Automaton has 247326 states and 407108 transitions. Word has length 227 [2024-11-07 00:22:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:11,234 INFO L471 AbstractCegarLoop]: Abstraction has 247326 states and 407108 transitions. [2024-11-07 00:22:11,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 247326 states and 407108 transitions. [2024-11-07 00:22:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-07 00:22:11,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:11,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:11,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:22:11,236 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:22:11,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash -749974056, now seen corresponding path program 1 times [2024-11-07 00:22:11,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:11,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492621504] [2024-11-07 00:22:11,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:11,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:11,967 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:22:11,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:11,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492621504] [2024-11-07 00:22:11,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492621504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:11,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:11,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:22:11,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367581767] [2024-11-07 00:22:11,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:11,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:22:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:11,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:22:11,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:22:11,970 INFO L87 Difference]: Start difference. First operand 247326 states and 407108 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:15,416 INFO L93 Difference]: Finished difference Result 809461 states and 1334923 transitions. [2024-11-07 00:22:15,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:22:15,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2024-11-07 00:22:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:17,231 INFO L225 Difference]: With dead ends: 809461 [2024-11-07 00:22:17,231 INFO L226 Difference]: Without dead ends: 562772 [2024-11-07 00:22:17,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:22:17,357 INFO L432 NwaCegarLoop]: 1275 mSDtfsCounter, 933 mSDsluCounter, 2760 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 4035 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:17,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 4035 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:22:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562772 states. [2024-11-07 00:22:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562772 to 404324. [2024-11-07 00:22:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404324 states, 404323 states have (on average 1.6432357298496498) internal successors, (664398), 404323 states have internal predecessors, (664398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404324 states to 404324 states and 664398 transitions. [2024-11-07 00:22:24,400 INFO L78 Accepts]: Start accepts. Automaton has 404324 states and 664398 transitions. Word has length 228 [2024-11-07 00:22:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:24,400 INFO L471 AbstractCegarLoop]: Abstraction has 404324 states and 664398 transitions. [2024-11-07 00:22:24,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 404324 states and 664398 transitions. [2024-11-07 00:22:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-07 00:22:24,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:24,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:24,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:22:24,403 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:22:24,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:24,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1827746913, now seen corresponding path program 1 times [2024-11-07 00:22:24,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:24,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702519006] [2024-11-07 00:22:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:24,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:25,408 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:22:25,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:25,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702519006] [2024-11-07 00:22:25,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702519006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:25,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:25,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:22:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716545258] [2024-11-07 00:22:25,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:25,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:22:25,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:25,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:22:25,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:22:25,412 INFO L87 Difference]: Start difference. First operand 404324 states and 664398 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:31,109 INFO L93 Difference]: Finished difference Result 1314037 states and 2163467 transitions. [2024-11-07 00:22:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:22:31,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2024-11-07 00:22:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted.