./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.BOUNDED-8.pals.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/pals_floodmax.4.3.ufo.BOUNDED-8.pals.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', '92cde93213bbdc81547d3bc892d5e318fc734fba39005e38f7e15156190bb05f'] 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/pals_floodmax.4.3.ufo.BOUNDED-8.pals.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 92cde93213bbdc81547d3bc892d5e318fc734fba39005e38f7e15156190bb05f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:02:52,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:02:52,483 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:02:52,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:02:52,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:02:52,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:02:52,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:02:52,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:02:52,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:02:52,513 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:02:52,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:02:52,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:02:52,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:02:52,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:02:52,514 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:02:52,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:02:52,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:02:52,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:02:52,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:02:52,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:02:52,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:02:52,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:02:52,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:02:52,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:02:52,515 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:02:52,515 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:02:52,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:02:52,515 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:02:52,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:02:52,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:02:52,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:02:52,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:02:52,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:02:52,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:02:52,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:02:52,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:02:52,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:02:52,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:02:52,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:02:52,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:02:52,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:02:52,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:02:52,518 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 -> 92cde93213bbdc81547d3bc892d5e318fc734fba39005e38f7e15156190bb05f [2024-11-07 00:02:52,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:02:52,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:02:52,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:02:52,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:02:52,784 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:02:52,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c [2024-11-07 00:02:54,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:02:54,290 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:02:54,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c [2024-11-07 00:02:54,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58fa8caeb/da1e37f3a7884c498c1d1ce86a37cf83/FLAG20481ea9f [2024-11-07 00:02:54,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58fa8caeb/da1e37f3a7884c498c1d1ce86a37cf83 [2024-11-07 00:02:54,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:02:54,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:02:54,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:02:54,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:02:54,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:02:54,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:02:54" (1/1) ... [2024-11-07 00:02:54,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566b1053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54, skipping insertion in model container [2024-11-07 00:02:54,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:02:54" (1/1) ... [2024-11-07 00:02:54,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:02:54,824 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/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c[28194,28207] [2024-11-07 00:02:54,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:02:54,835 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:02:54,887 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/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c[28194,28207] [2024-11-07 00:02:54,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:02:54,904 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:02:54,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54 WrapperNode [2024-11-07 00:02:54,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:02:54,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:02:54,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:02:54,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:02:54,910 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:02:54" (1/1) ... [2024-11-07 00:02:54,917 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:02:54" (1/1) ... [2024-11-07 00:02:54,947 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 958 [2024-11-07 00:02:54,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:02:54,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:02:54,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:02:54,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:02:54,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54" (1/1) ... [2024-11-07 00:02:54,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54" (1/1) ... [2024-11-07 00:02:54,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54" (1/1) ... [2024-11-07 00:02:54,981 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:02:54,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54" (1/1) ... [2024-11-07 00:02:54,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54" (1/1) ... [2024-11-07 00:02:54,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54" (1/1) ... [2024-11-07 00:02:55,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54" (1/1) ... [2024-11-07 00:02:55,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54" (1/1) ... [2024-11-07 00:02:55,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54" (1/1) ... [2024-11-07 00:02:55,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:02:55,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:02:55,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:02:55,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:02:55,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54" (1/1) ... [2024-11-07 00:02:55,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:02:55,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:02:55,051 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:02:55,056 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:02:55,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:02:55,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:02:55,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:02:55,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:02:55,173 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:02:55,179 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:02:56,013 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-07 00:02:56,013 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:02:56,031 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:02:56,033 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:02:56,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:02:56 BoogieIcfgContainer [2024-11-07 00:02:56,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:02:56,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:02:56,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:02:56,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:02:56,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:02:54" (1/3) ... [2024-11-07 00:02:56,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588cf964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:02:56, skipping insertion in model container [2024-11-07 00:02:56,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:54" (2/3) ... [2024-11-07 00:02:56,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588cf964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:02:56, skipping insertion in model container [2024-11-07 00:02:56,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:02:56" (3/3) ... [2024-11-07 00:02:56,041 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.BOUNDED-8.pals.c [2024-11-07 00:02:56,054 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:02:56,054 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:02:56,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:02:56,121 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;@45cd35f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:02:56,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:02:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 278 states have (on average 1.8345323741007193) internal successors, (510), 279 states have internal predecessors, (510), 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:02:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:02:56,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:56,137 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] [2024-11-07 00:02:56,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:56,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:56,141 INFO L85 PathProgramCache]: Analyzing trace with hash -875885192, now seen corresponding path program 1 times [2024-11-07 00:02:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282250926] [2024-11-07 00:02:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:56,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:56,568 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:02:56,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:56,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282250926] [2024-11-07 00:02:56,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282250926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:56,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:56,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:02:56,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848092354] [2024-11-07 00:02:56,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:56,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:02:56,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:56,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:02:56,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:02:56,606 INFO L87 Difference]: Start difference. First operand has 280 states, 278 states have (on average 1.8345323741007193) internal successors, (510), 279 states have internal predecessors, (510), 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 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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:02:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:56,631 INFO L93 Difference]: Finished difference Result 369 states and 666 transitions. [2024-11-07 00:02:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:02:56,633 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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 77 [2024-11-07 00:02:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:56,639 INFO L225 Difference]: With dead ends: 369 [2024-11-07 00:02:56,639 INFO L226 Difference]: Without dead ends: 276 [2024-11-07 00:02:56,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:02:56,643 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:02:56,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-07 00:02:56,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-07 00:02:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.829090909090909) internal successors, (503), 275 states have internal predecessors, (503), 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:02:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 503 transitions. [2024-11-07 00:02:56,690 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 503 transitions. Word has length 77 [2024-11-07 00:02:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:56,691 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 503 transitions. [2024-11-07 00:02:56,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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:02:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 503 transitions. [2024-11-07 00:02:56,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:02:56,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:56,695 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] [2024-11-07 00:02:56,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:02:56,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:56,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:56,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1009898698, now seen corresponding path program 1 times [2024-11-07 00:02:56,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:56,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845598410] [2024-11-07 00:02:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:57,048 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:02:57,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:57,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845598410] [2024-11-07 00:02:57,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845598410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:57,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:57,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:02:57,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852918661] [2024-11-07 00:02:57,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:57,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:02:57,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:57,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:02:57,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:02:57,053 INFO L87 Difference]: Start difference. First operand 276 states and 503 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:02:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:57,155 INFO L93 Difference]: Finished difference Result 364 states and 656 transitions. [2024-11-07 00:02:57,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:02:57,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-07 00:02:57,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:57,157 INFO L225 Difference]: With dead ends: 364 [2024-11-07 00:02:57,158 INFO L226 Difference]: Without dead ends: 276 [2024-11-07 00:02:57,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:02:57,159 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 0 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:02:57,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1957 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:02:57,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-07 00:02:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-07 00:02:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.6763636363636363) internal successors, (461), 275 states have internal predecessors, (461), 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:02:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 461 transitions. [2024-11-07 00:02:57,174 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 461 transitions. Word has length 77 [2024-11-07 00:02:57,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:57,174 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 461 transitions. [2024-11-07 00:02:57,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:02:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 461 transitions. [2024-11-07 00:02:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 00:02:57,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:57,179 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] [2024-11-07 00:02:57,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:02:57,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:57,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1489902654, now seen corresponding path program 1 times [2024-11-07 00:02:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:57,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136317039] [2024-11-07 00:02:57,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:57,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:57,431 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:02:57,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136317039] [2024-11-07 00:02:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136317039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:57,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:57,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:57,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170299679] [2024-11-07 00:02:57,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:57,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:57,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:57,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:57,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:57,434 INFO L87 Difference]: Start difference. First operand 276 states and 461 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:02:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:57,502 INFO L93 Difference]: Finished difference Result 433 states and 738 transitions. [2024-11-07 00:02:57,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:57,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 118 [2024-11-07 00:02:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:57,505 INFO L225 Difference]: With dead ends: 433 [2024-11-07 00:02:57,506 INFO L226 Difference]: Without dead ends: 349 [2024-11-07 00:02:57,506 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:02:57,508 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 120 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:02:57,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 977 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:02:57,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-07 00:02:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2024-11-07 00:02:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.6849710982658959) internal successors, (583), 346 states have internal predecessors, (583), 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:02:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 583 transitions. [2024-11-07 00:02:57,524 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 583 transitions. Word has length 118 [2024-11-07 00:02:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:57,524 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 583 transitions. [2024-11-07 00:02:57,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:02:57,524 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 583 transitions. [2024-11-07 00:02:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 00:02:57,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:57,531 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] [2024-11-07 00:02:57,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:02:57,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:57,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:57,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1238623676, now seen corresponding path program 1 times [2024-11-07 00:02:57,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:57,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827506193] [2024-11-07 00:02:57,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:57,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:57,683 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:02:57,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827506193] [2024-11-07 00:02:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827506193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:57,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:57,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873619795] [2024-11-07 00:02:57,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:57,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:57,685 INFO L87 Difference]: Start difference. First operand 347 states and 583 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:02:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:57,720 INFO L93 Difference]: Finished difference Result 503 states and 858 transitions. [2024-11-07 00:02:57,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:57,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121 [2024-11-07 00:02:57,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:57,723 INFO L225 Difference]: With dead ends: 503 [2024-11-07 00:02:57,724 INFO L226 Difference]: Without dead ends: 419 [2024-11-07 00:02:57,724 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:02:57,725 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 129 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1011 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:02:57,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1011 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:57,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-07 00:02:57,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2024-11-07 00:02:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.6971153846153846) internal successors, (706), 416 states have internal predecessors, (706), 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:02:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 706 transitions. [2024-11-07 00:02:57,737 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 706 transitions. Word has length 121 [2024-11-07 00:02:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:57,737 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 706 transitions. [2024-11-07 00:02:57,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:02:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 706 transitions. [2024-11-07 00:02:57,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 00:02:57,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:57,739 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] [2024-11-07 00:02:57,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:02:57,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:57,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:57,740 INFO L85 PathProgramCache]: Analyzing trace with hash 942583131, now seen corresponding path program 1 times [2024-11-07 00:02:57,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:57,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715913849] [2024-11-07 00:02:57,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:57,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:57,873 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:02:57,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:57,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715913849] [2024-11-07 00:02:57,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715913849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:57,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:57,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:57,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973294739] [2024-11-07 00:02:57,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:57,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:57,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:57,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:57,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:57,874 INFO L87 Difference]: Start difference. First operand 417 states and 706 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:02:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:57,911 INFO L93 Difference]: Finished difference Result 836 states and 1439 transitions. [2024-11-07 00:02:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:57,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121 [2024-11-07 00:02:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:57,918 INFO L225 Difference]: With dead ends: 836 [2024-11-07 00:02:57,918 INFO L226 Difference]: Without dead ends: 613 [2024-11-07 00:02:57,918 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:02:57,919 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 121 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 988 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:02:57,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 988 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:57,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-07 00:02:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2024-11-07 00:02:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 610 states have (on average 1.7098360655737705) internal successors, (1043), 610 states have internal predecessors, (1043), 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:02:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1043 transitions. [2024-11-07 00:02:57,935 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1043 transitions. Word has length 121 [2024-11-07 00:02:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:57,935 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 1043 transitions. [2024-11-07 00:02:57,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:02:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1043 transitions. [2024-11-07 00:02:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:02:57,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:57,936 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] [2024-11-07 00:02:57,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:02:57,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:57,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:57,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2091470231, now seen corresponding path program 1 times [2024-11-07 00:02:57,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:57,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034370743] [2024-11-07 00:02:57,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:57,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:58,050 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:02:58,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:58,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034370743] [2024-11-07 00:02:58,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034370743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:58,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:58,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:58,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896159801] [2024-11-07 00:02:58,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:58,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:58,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:58,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:58,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:58,052 INFO L87 Difference]: Start difference. First operand 611 states and 1043 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:02:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:58,077 INFO L93 Difference]: Finished difference Result 1022 states and 1760 transitions. [2024-11-07 00:02:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:58,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 124 [2024-11-07 00:02:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:58,081 INFO L225 Difference]: With dead ends: 1022 [2024-11-07 00:02:58,081 INFO L226 Difference]: Without dead ends: 799 [2024-11-07 00:02:58,081 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:02:58,082 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 122 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1001 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:02:58,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1001 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-07 00:02:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 797. [2024-11-07 00:02:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.7123115577889447) internal successors, (1363), 796 states have internal predecessors, (1363), 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:02:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1363 transitions. [2024-11-07 00:02:58,098 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1363 transitions. Word has length 124 [2024-11-07 00:02:58,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:58,099 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1363 transitions. [2024-11-07 00:02:58,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:02:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1363 transitions. [2024-11-07 00:02:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:02:58,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:58,100 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] [2024-11-07 00:02:58,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:02:58,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:58,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:58,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2013778626, now seen corresponding path program 1 times [2024-11-07 00:02:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558635716] [2024-11-07 00:02:58,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:58,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:58,232 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:02:58,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558635716] [2024-11-07 00:02:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558635716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:58,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:58,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:58,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946599900] [2024-11-07 00:02:58,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:58,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:58,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:58,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:58,234 INFO L87 Difference]: Start difference. First operand 797 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:02:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:58,275 INFO L93 Difference]: Finished difference Result 1908 states and 3288 transitions. [2024-11-07 00:02:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:58,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 124 [2024-11-07 00:02:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:58,280 INFO L225 Difference]: With dead ends: 1908 [2024-11-07 00:02:58,280 INFO L226 Difference]: Without dead ends: 1312 [2024-11-07 00:02:58,281 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:02:58,281 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 114 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 979 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:02:58,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 979 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-07 00:02:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1310. [2024-11-07 00:02:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1309 states have (on average 1.7104660045836517) internal successors, (2239), 1309 states have internal predecessors, (2239), 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:02:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 2239 transitions. [2024-11-07 00:02:58,311 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 2239 transitions. Word has length 124 [2024-11-07 00:02:58,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:58,312 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 2239 transitions. [2024-11-07 00:02:58,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:02:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 2239 transitions. [2024-11-07 00:02:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 00:02:58,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:58,314 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] [2024-11-07 00:02:58,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:02:58,315 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:58,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1950081272, now seen corresponding path program 1 times [2024-11-07 00:02:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:58,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656349980] [2024-11-07 00:02:58,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:58,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:58,407 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:02:58,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:58,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656349980] [2024-11-07 00:02:58,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656349980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:58,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:58,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:58,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415780047] [2024-11-07 00:02:58,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:58,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:58,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:58,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:58,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:58,409 INFO L87 Difference]: Start difference. First operand 1310 states and 2239 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:02:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:58,439 INFO L93 Difference]: Finished difference Result 2383 states and 4094 transitions. [2024-11-07 00:02:58,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:58,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 127 [2024-11-07 00:02:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:58,445 INFO L225 Difference]: With dead ends: 2383 [2024-11-07 00:02:58,445 INFO L226 Difference]: Without dead ends: 1787 [2024-11-07 00:02:58,446 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:02:58,446 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 115 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 991 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:02:58,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 991 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2024-11-07 00:02:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1785. [2024-11-07 00:02:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1784 states have (on average 1.7062780269058295) internal successors, (3044), 1784 states have internal predecessors, (3044), 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:02:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 3044 transitions. [2024-11-07 00:02:58,500 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 3044 transitions. Word has length 127 [2024-11-07 00:02:58,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:58,501 INFO L471 AbstractCegarLoop]: Abstraction has 1785 states and 3044 transitions. [2024-11-07 00:02:58,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:02:58,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 3044 transitions. [2024-11-07 00:02:58,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 00:02:58,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:58,502 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] [2024-11-07 00:02:58,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:02:58,502 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:58,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:58,503 INFO L85 PathProgramCache]: Analyzing trace with hash 114997535, now seen corresponding path program 1 times [2024-11-07 00:02:58,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:58,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103682384] [2024-11-07 00:02:58,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:58,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:58,635 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:02:58,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:58,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103682384] [2024-11-07 00:02:58,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103682384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:58,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:58,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:58,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696381889] [2024-11-07 00:02:58,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:58,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:58,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:58,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:58,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:58,637 INFO L87 Difference]: Start difference. First operand 1785 states and 3044 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:02:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:58,682 INFO L93 Difference]: Finished difference Result 4696 states and 8005 transitions. [2024-11-07 00:02:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:58,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 127 [2024-11-07 00:02:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:58,692 INFO L225 Difference]: With dead ends: 4696 [2024-11-07 00:02:58,692 INFO L226 Difference]: Without dead ends: 3119 [2024-11-07 00:02:58,694 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:02:58,695 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 107 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 970 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:02:58,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 970 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2024-11-07 00:02:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 3117. [2024-11-07 00:02:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3117 states, 3116 states have (on average 1.6903080872913991) internal successors, (5267), 3116 states have internal predecessors, (5267), 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:02:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 5267 transitions. [2024-11-07 00:02:58,757 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 5267 transitions. Word has length 127 [2024-11-07 00:02:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:58,757 INFO L471 AbstractCegarLoop]: Abstraction has 3117 states and 5267 transitions. [2024-11-07 00:02:58,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:02:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 5267 transitions. [2024-11-07 00:02:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 00:02:58,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:58,758 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] [2024-11-07 00:02:58,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:02:58,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:58,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1099622423, now seen corresponding path program 1 times [2024-11-07 00:02:58,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:58,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906486159] [2024-11-07 00:02:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:58,876 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:02:58,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906486159] [2024-11-07 00:02:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906486159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:58,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:58,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:58,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726701608] [2024-11-07 00:02:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:58,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:58,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:58,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:58,878 INFO L87 Difference]: Start difference. First operand 3117 states and 5267 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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:02:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:58,935 INFO L93 Difference]: Finished difference Result 5900 states and 9996 transitions. [2024-11-07 00:02:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:58,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 130 [2024-11-07 00:02:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:58,950 INFO L225 Difference]: With dead ends: 5900 [2024-11-07 00:02:58,951 INFO L226 Difference]: Without dead ends: 4323 [2024-11-07 00:02:58,954 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:02:58,954 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 108 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 981 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:02:58,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 981 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2024-11-07 00:02:59,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 4321. [2024-11-07 00:02:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4321 states, 4320 states have (on average 1.679861111111111) internal successors, (7257), 4320 states have internal predecessors, (7257), 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:02:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 7257 transitions. [2024-11-07 00:02:59,056 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 7257 transitions. Word has length 130 [2024-11-07 00:02:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:59,058 INFO L471 AbstractCegarLoop]: Abstraction has 4321 states and 7257 transitions. [2024-11-07 00:02:59,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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:02:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 7257 transitions. [2024-11-07 00:02:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 00:02:59,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:59,059 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] [2024-11-07 00:02:59,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:02:59,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:59,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1139060542, now seen corresponding path program 1 times [2024-11-07 00:02:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:59,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778477739] [2024-11-07 00:02:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:59,273 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:02:59,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:59,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778477739] [2024-11-07 00:02:59,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778477739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:59,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:59,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:02:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850911404] [2024-11-07 00:02:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:59,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:02:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:02:59,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:02:59,275 INFO L87 Difference]: Start difference. First operand 4321 states and 7257 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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:02:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:59,683 INFO L93 Difference]: Finished difference Result 27701 states and 47018 transitions. [2024-11-07 00:02:59,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:02:59,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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 130 [2024-11-07 00:02:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:59,755 INFO L225 Difference]: With dead ends: 27701 [2024-11-07 00:02:59,756 INFO L226 Difference]: Without dead ends: 23595 [2024-11-07 00:02:59,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:02:59,767 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 1656 mSDsluCounter, 2313 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 2764 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:02:59,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 2764 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:02:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23595 states. [2024-11-07 00:03:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23595 to 8277. [2024-11-07 00:03:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8277 states, 8276 states have (on average 1.6718221362977284) internal successors, (13836), 8276 states have internal predecessors, (13836), 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:03:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 13836 transitions. [2024-11-07 00:03:00,180 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 13836 transitions. Word has length 130 [2024-11-07 00:03:00,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:00,180 INFO L471 AbstractCegarLoop]: Abstraction has 8277 states and 13836 transitions. [2024-11-07 00:03:00,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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:03:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 13836 transitions. [2024-11-07 00:03:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 00:03:00,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:00,181 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] [2024-11-07 00:03:00,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:03:00,182 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:00,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:00,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1143468315, now seen corresponding path program 1 times [2024-11-07 00:03:00,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:00,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142705191] [2024-11-07 00:03:00,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:00,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:00,357 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:03:00,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:00,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142705191] [2024-11-07 00:03:00,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142705191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:00,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:00,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:03:00,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184550126] [2024-11-07 00:03:00,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:00,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:03:00,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:00,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:03:00,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:03:00,359 INFO L87 Difference]: Start difference. First operand 8277 states and 13836 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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:03:00,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:00,648 INFO L93 Difference]: Finished difference Result 27383 states and 46124 transitions. [2024-11-07 00:03:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:03:00,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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 131 [2024-11-07 00:03:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:00,683 INFO L225 Difference]: With dead ends: 27383 [2024-11-07 00:03:00,686 INFO L226 Difference]: Without dead ends: 19321 [2024-11-07 00:03:00,702 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:03:00,703 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 423 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1451 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:03:00,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1451 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19321 states. [2024-11-07 00:03:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19321 to 13744. [2024-11-07 00:03:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13744 states, 13743 states have (on average 1.6712508185985593) internal successors, (22968), 13743 states have internal predecessors, (22968), 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:03:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13744 states to 13744 states and 22968 transitions. [2024-11-07 00:03:01,077 INFO L78 Accepts]: Start accepts. Automaton has 13744 states and 22968 transitions. Word has length 131 [2024-11-07 00:03:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:01,078 INFO L471 AbstractCegarLoop]: Abstraction has 13744 states and 22968 transitions. [2024-11-07 00:03:01,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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:03:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 13744 states and 22968 transitions. [2024-11-07 00:03:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 00:03:01,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:01,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:01,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:03:01,079 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:01,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1281585493, now seen corresponding path program 1 times [2024-11-07 00:03:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:01,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962276241] [2024-11-07 00:03:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:01,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:01,236 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:03:01,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:01,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962276241] [2024-11-07 00:03:01,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962276241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:01,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:01,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:03:01,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396891168] [2024-11-07 00:03:01,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:01,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:03:01,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:01,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:03:01,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:03:01,237 INFO L87 Difference]: Start difference. First operand 13744 states and 22968 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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:03:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:01,601 INFO L93 Difference]: Finished difference Result 45169 states and 75660 transitions. [2024-11-07 00:03:01,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:03:01,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 132 [2024-11-07 00:03:01,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:01,658 INFO L225 Difference]: With dead ends: 45169 [2024-11-07 00:03:01,658 INFO L226 Difference]: Without dead ends: 31640 [2024-11-07 00:03:01,684 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:03:01,687 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 421 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1453 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:03:01,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1453 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31640 states. [2024-11-07 00:03:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31640 to 22603. [2024-11-07 00:03:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22603 states, 22602 states have (on average 1.662065303955402) internal successors, (37566), 22602 states have internal predecessors, (37566), 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:03:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22603 states to 22603 states and 37566 transitions. [2024-11-07 00:03:02,374 INFO L78 Accepts]: Start accepts. Automaton has 22603 states and 37566 transitions. Word has length 132 [2024-11-07 00:03:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:02,375 INFO L471 AbstractCegarLoop]: Abstraction has 22603 states and 37566 transitions. [2024-11-07 00:03:02,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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:03:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 22603 states and 37566 transitions. [2024-11-07 00:03:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 00:03:02,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:02,377 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] [2024-11-07 00:03:02,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:03:02,377 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:02,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash -682153444, now seen corresponding path program 1 times [2024-11-07 00:03:02,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:02,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901253962] [2024-11-07 00:03:02,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:02,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:02,529 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:03:02,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:02,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901253962] [2024-11-07 00:03:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901253962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:02,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:03:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949265529] [2024-11-07 00:03:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:02,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:03:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:02,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:03:02,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:03:02,531 INFO L87 Difference]: Start difference. First operand 22603 states and 37566 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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:03:03,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:03,128 INFO L93 Difference]: Finished difference Result 74067 states and 123372 transitions. [2024-11-07 00:03:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:03:03,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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 133 [2024-11-07 00:03:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:03,238 INFO L225 Difference]: With dead ends: 74067 [2024-11-07 00:03:03,239 INFO L226 Difference]: Without dead ends: 51679 [2024-11-07 00:03:03,283 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:03:03,283 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 419 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1455 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:03:03,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1455 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51679 states. [2024-11-07 00:03:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51679 to 36998. [2024-11-07 00:03:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36998 states, 36997 states have (on average 1.6528907749276969) internal successors, (61152), 36997 states have internal predecessors, (61152), 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:03:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36998 states to 36998 states and 61152 transitions. [2024-11-07 00:03:04,170 INFO L78 Accepts]: Start accepts. Automaton has 36998 states and 61152 transitions. Word has length 133 [2024-11-07 00:03:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:04,170 INFO L471 AbstractCegarLoop]: Abstraction has 36998 states and 61152 transitions. [2024-11-07 00:03:04,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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:03:04,171 INFO L276 IsEmpty]: Start isEmpty. Operand 36998 states and 61152 transitions. [2024-11-07 00:03:04,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:03:04,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:04,172 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] [2024-11-07 00:03:04,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:03:04,172 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:04,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:04,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1259514004, now seen corresponding path program 1 times [2024-11-07 00:03:04,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:04,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818426671] [2024-11-07 00:03:04,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:04,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:04,287 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:03:04,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:04,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818426671] [2024-11-07 00:03:04,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818426671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:04,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:04,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:03:04,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651181023] [2024-11-07 00:03:04,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:04,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:03:04,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:04,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:03:04,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:03:04,289 INFO L87 Difference]: Start difference. First operand 36998 states and 61152 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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:03:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:05,302 INFO L93 Difference]: Finished difference Result 119893 states and 198604 transitions. [2024-11-07 00:03:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:03:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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 134 [2024-11-07 00:03:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:05,469 INFO L225 Difference]: With dead ends: 119893 [2024-11-07 00:03:05,470 INFO L226 Difference]: Without dead ends: 83110 [2024-11-07 00:03:05,525 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:03:05,525 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 417 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1463 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.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:05,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1463 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83110 states. [2024-11-07 00:03:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83110 to 59829. [2024-11-07 00:03:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59829 states, 59828 states have (on average 1.6440128367988234) internal successors, (98358), 59828 states have internal predecessors, (98358), 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:03:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59829 states to 59829 states and 98358 transitions. [2024-11-07 00:03:06,750 INFO L78 Accepts]: Start accepts. Automaton has 59829 states and 98358 transitions. Word has length 134 [2024-11-07 00:03:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:06,750 INFO L471 AbstractCegarLoop]: Abstraction has 59829 states and 98358 transitions. [2024-11-07 00:03:06,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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:03:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 59829 states and 98358 transitions. [2024-11-07 00:03:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 00:03:06,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:06,751 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] [2024-11-07 00:03:06,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:03:06,752 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:06,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1428334268, now seen corresponding path program 1 times [2024-11-07 00:03:06,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:06,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403871300] [2024-11-07 00:03:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:06,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:07,050 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:03:07,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:07,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403871300] [2024-11-07 00:03:07,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403871300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:07,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:07,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:03:07,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925768766] [2024-11-07 00:03:07,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:07,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:03:07,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:07,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:03:07,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:03:07,053 INFO L87 Difference]: Start difference. First operand 59829 states and 98358 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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:03:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:08,174 INFO L93 Difference]: Finished difference Result 119445 states and 196373 transitions. [2024-11-07 00:03:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:03:08,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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 136 [2024-11-07 00:03:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:08,286 INFO L225 Difference]: With dead ends: 119445 [2024-11-07 00:03:08,286 INFO L226 Difference]: Without dead ends: 59831 [2024-11-07 00:03:08,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:03:08,329 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 217 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:08,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1730 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59831 states. [2024-11-07 00:03:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59831 to 59829. [2024-11-07 00:03:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59829 states, 59828 states have (on average 1.6335662231730963) internal successors, (97733), 59828 states have internal predecessors, (97733), 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:03:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59829 states to 59829 states and 97733 transitions. [2024-11-07 00:03:09,477 INFO L78 Accepts]: Start accepts. Automaton has 59829 states and 97733 transitions. Word has length 136 [2024-11-07 00:03:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:09,478 INFO L471 AbstractCegarLoop]: Abstraction has 59829 states and 97733 transitions. [2024-11-07 00:03:09,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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:03:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 59829 states and 97733 transitions. [2024-11-07 00:03:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 00:03:09,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:09,479 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] [2024-11-07 00:03:09,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:03:09,480 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:09,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1982359839, now seen corresponding path program 1 times [2024-11-07 00:03:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:09,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465928114] [2024-11-07 00:03:09,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:03:09,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:09,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465928114] [2024-11-07 00:03:09,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465928114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:09,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:09,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:03:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188320964] [2024-11-07 00:03:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:09,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:03:09,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:09,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:03:09,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:03:09,763 INFO L87 Difference]: Start difference. First operand 59829 states and 97733 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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:03:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:11,052 INFO L93 Difference]: Finished difference Result 174963 states and 286257 transitions. [2024-11-07 00:03:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:03:11,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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 139 [2024-11-07 00:03:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:11,255 INFO L225 Difference]: With dead ends: 174963 [2024-11-07 00:03:11,256 INFO L226 Difference]: Without dead ends: 115349 [2024-11-07 00:03:11,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:03:11,303 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 108 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:11,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 2172 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115349 states. [2024-11-07 00:03:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115349 to 115347. [2024-11-07 00:03:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115347 states, 115346 states have (on average 1.6199087961437761) internal successors, (186850), 115346 states have internal predecessors, (186850), 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:03:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115347 states to 115347 states and 186850 transitions. [2024-11-07 00:03:13,424 INFO L78 Accepts]: Start accepts. Automaton has 115347 states and 186850 transitions. Word has length 139 [2024-11-07 00:03:13,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:13,425 INFO L471 AbstractCegarLoop]: Abstraction has 115347 states and 186850 transitions. [2024-11-07 00:03:13,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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:03:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 115347 states and 186850 transitions. [2024-11-07 00:03:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 00:03:13,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:13,426 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] [2024-11-07 00:03:13,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:03:13,426 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:13,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:13,426 INFO L85 PathProgramCache]: Analyzing trace with hash 892267437, now seen corresponding path program 1 times [2024-11-07 00:03:13,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:13,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877213475] [2024-11-07 00:03:13,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:13,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:14,320 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:03:14,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:14,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877213475] [2024-11-07 00:03:14,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877213475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:14,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:14,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:03:14,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786805054] [2024-11-07 00:03:14,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:14,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:03:14,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:14,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:03:14,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:03:14,321 INFO L87 Difference]: Start difference. First operand 115347 states and 186850 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 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:03:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:15,492 INFO L93 Difference]: Finished difference Result 121157 states and 194595 transitions. [2024-11-07 00:03:15,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:03:15,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 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 140 [2024-11-07 00:03:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:15,667 INFO L225 Difference]: With dead ends: 121157 [2024-11-07 00:03:15,667 INFO L226 Difference]: Without dead ends: 121155 [2024-11-07 00:03:15,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:03:15,705 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 0 mSDsluCounter, 2711 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3166 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:15,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3166 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121155 states. [2024-11-07 00:03:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121155 to 121155. [2024-11-07 00:03:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121155 states, 121154 states have (on average 1.5899681397229972) internal successors, (192631), 121154 states have internal predecessors, (192631), 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:03:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121155 states to 121155 states and 192631 transitions. [2024-11-07 00:03:17,902 INFO L78 Accepts]: Start accepts. Automaton has 121155 states and 192631 transitions. Word has length 140 [2024-11-07 00:03:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:17,903 INFO L471 AbstractCegarLoop]: Abstraction has 121155 states and 192631 transitions. [2024-11-07 00:03:17,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 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:03:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 121155 states and 192631 transitions. [2024-11-07 00:03:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 00:03:17,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:17,917 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:17,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:03:17,917 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:17,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:17,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1970326679, now seen corresponding path program 1 times [2024-11-07 00:03:17,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:17,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185104967] [2024-11-07 00:03:17,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:17,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:03:18,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:18,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185104967] [2024-11-07 00:03:18,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185104967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:18,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:18,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55095319] [2024-11-07 00:03:18,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:18,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:18,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:18,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:18,023 INFO L87 Difference]: Start difference. First operand 121155 states and 192631 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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:03:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:20,306 INFO L93 Difference]: Finished difference Result 362460 states and 575899 transitions. [2024-11-07 00:03:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:20,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 175 [2024-11-07 00:03:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:20,750 INFO L225 Difference]: With dead ends: 362460 [2024-11-07 00:03:20,751 INFO L226 Difference]: Without dead ends: 241366 [2024-11-07 00:03:20,842 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:03:20,843 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 378 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:20,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1212 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:21,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241366 states. [2024-11-07 00:03:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241366 to 241364. [2024-11-07 00:03:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241364 states, 241363 states have (on average 1.579019982350236) internal successors, (381117), 241363 states have internal predecessors, (381117), 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:03:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241364 states to 241364 states and 381117 transitions. [2024-11-07 00:03:25,371 INFO L78 Accepts]: Start accepts. Automaton has 241364 states and 381117 transitions. Word has length 175 [2024-11-07 00:03:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:25,371 INFO L471 AbstractCegarLoop]: Abstraction has 241364 states and 381117 transitions. [2024-11-07 00:03:25,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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:03:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 241364 states and 381117 transitions. [2024-11-07 00:03:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 00:03:25,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:25,382 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:25,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:03:25,382 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:25,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1522395712, now seen corresponding path program 1 times [2024-11-07 00:03:25,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:25,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666823678] [2024-11-07 00:03:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:25,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 00:03:25,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:25,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666823678] [2024-11-07 00:03:25,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666823678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:25,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:25,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:25,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55894203] [2024-11-07 00:03:25,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:25,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:25,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:25,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:25,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:25,490 INFO L87 Difference]: Start difference. First operand 241364 states and 381117 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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:03:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:30,320 INFO L93 Difference]: Finished difference Result 722076 states and 1139352 transitions. [2024-11-07 00:03:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:30,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 175 [2024-11-07 00:03:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:31,366 INFO L225 Difference]: With dead ends: 722076 [2024-11-07 00:03:31,367 INFO L226 Difference]: Without dead ends: 480817 [2024-11-07 00:03:31,556 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:03:31,560 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 319 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:31,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1142 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480817 states.