./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i --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/uthash-2.0.2/uthash_SAX_test6-2.i', '-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', 'bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4'] 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/uthash-2.0.2/uthash_SAX_test6-2.i -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 bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:08:29,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:08:29,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 15:08:29,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:08:29,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:08:29,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:08:29,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:08:29,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:08:29,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 15:08:29,628 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 15:08:29,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:08:29,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:08:29,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:08:29,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:08:29,630 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:08:29,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:08:29,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:08:29,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:08:29,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:08:29,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:08:29,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:08:29,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:08:29,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:08:29,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:08:29,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:08:29,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:08:29,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:08:29,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:08:29,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:08:29,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:08:29,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 15:08:29,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:08:29,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:08:29,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:08:29,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:08:29,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:08:29,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:08:29,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:08:29,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:08:29,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:08:29,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:08:29,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:08:29,633 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2024-11-07 15:08:29,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:08:29,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:08:29,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:08:29,872 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:08:29,872 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:08:29,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-07 15:08:31,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:08:31,325 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:08:31,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-07 15:08:31,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3e766963/00f2740efa42499d8a2ae27a121b443b/FLAG4753bfd37 [2024-11-07 15:08:31,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3e766963/00f2740efa42499d8a2ae27a121b443b [2024-11-07 15:08:31,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:08:31,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:08:31,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:08:31,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:08:31,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:08:31,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:31,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb0e04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31, skipping insertion in model container [2024-11-07 15:08:31,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:31,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:08:31,728 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/uthash-2.0.2/uthash_SAX_test6-2.i[44118,44131] [2024-11-07 15:08:31,739 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/uthash-2.0.2/uthash_SAX_test6-2.i[44660,44673] [2024-11-07 15:08:31,798 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/uthash-2.0.2/uthash_SAX_test6-2.i[56247,56260] [2024-11-07 15:08:31,799 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/uthash-2.0.2/uthash_SAX_test6-2.i[56368,56381] [2024-11-07 15:08:31,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:08:31,828 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:08:31,857 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/uthash-2.0.2/uthash_SAX_test6-2.i[44118,44131] [2024-11-07 15:08:31,859 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/uthash-2.0.2/uthash_SAX_test6-2.i[44660,44673] [2024-11-07 15:08:31,894 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/uthash-2.0.2/uthash_SAX_test6-2.i[56247,56260] [2024-11-07 15:08:31,895 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/uthash-2.0.2/uthash_SAX_test6-2.i[56368,56381] [2024-11-07 15:08:31,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:08:31,960 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:08:31,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31 WrapperNode [2024-11-07 15:08:31,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:08:31,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:08:31,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:08:31,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:08:31,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:31,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:32,034 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1647 [2024-11-07 15:08:32,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:08:32,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:08:32,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:08:32,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:08:32,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:32,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:32,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:32,128 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 34, 12, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 62 writes are split as follows [0, 4, 1, 57]. [2024-11-07 15:08:32,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:32,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:32,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:32,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:32,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:32,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:32,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:08:32,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:08:32,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:08:32,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:08:32,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (1/1) ... [2024-11-07 15:08:32,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:08:32,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:08:32,281 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 15:08:32,283 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 15:08:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 15:08:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 15:08:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 15:08:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 15:08:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 15:08:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 15:08:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-07 15:08:32,298 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-07 15:08:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 15:08:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 15:08:32,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 15:08:32,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 15:08:32,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 15:08:32,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 15:08:32,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 15:08:32,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 15:08:32,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 15:08:32,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 15:08:32,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:08:32,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:08:32,300 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-07 15:08:32,300 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-07 15:08:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 15:08:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 15:08:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 15:08:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 15:08:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-07 15:08:32,301 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-07 15:08:32,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 15:08:32,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 15:08:32,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 15:08:32,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 15:08:32,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:08:32,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:08:32,506 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:08:32,507 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:08:33,590 INFO L? ?]: Removed 364 outVars from TransFormulas that were not future-live. [2024-11-07 15:08:33,591 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:08:33,607 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:08:33,607 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-07 15:08:33,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:08:33 BoogieIcfgContainer [2024-11-07 15:08:33,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:08:33,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:08:33,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:08:33,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:08:33,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:08:31" (1/3) ... [2024-11-07 15:08:33,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4075aa86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:08:33, skipping insertion in model container [2024-11-07 15:08:33,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:08:31" (2/3) ... [2024-11-07 15:08:33,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4075aa86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:08:33, skipping insertion in model container [2024-11-07 15:08:33,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:08:33" (3/3) ... [2024-11-07 15:08:33,614 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2024-11-07 15:08:33,623 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:08:33,623 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 15:08:33,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:08:33,675 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;@14c81066, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:08:33,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 15:08:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 474 states, 450 states have (on average 1.5977777777777777) internal successors, (719), 454 states have internal predecessors, (719), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 15:08:33,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 15:08:33,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:33,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:08:33,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:33,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1705359720, now seen corresponding path program 1 times [2024-11-07 15:08:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:33,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506347453] [2024-11-07 15:08:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:33,803 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 15:08:33,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:33,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506347453] [2024-11-07 15:08:33,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506347453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:33,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:33,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:08:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455812237] [2024-11-07 15:08:33,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:33,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:08:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:33,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:08:33,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:08:33,820 INFO L87 Difference]: Start difference. First operand has 474 states, 450 states have (on average 1.5977777777777777) internal successors, (719), 454 states have internal predecessors, (719), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 15:08:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:33,863 INFO L93 Difference]: Finished difference Result 943 states and 1508 transitions. [2024-11-07 15:08:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:08:33,864 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-11-07 15:08:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:33,870 INFO L225 Difference]: With dead ends: 943 [2024-11-07 15:08:33,870 INFO L226 Difference]: Without dead ends: 467 [2024-11-07 15:08:33,875 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 15:08:33,877 INFO L432 NwaCegarLoop]: 667 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, 667 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 15:08:33,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 15:08:33,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-07 15:08:33,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2024-11-07 15:08:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 444 states have (on average 1.4256756756756757) internal successors, (633), 448 states have internal predecessors, (633), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 663 transitions. [2024-11-07 15:08:33,952 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 663 transitions. Word has length 8 [2024-11-07 15:08:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:33,952 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 663 transitions. [2024-11-07 15:08:33,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 15:08:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 663 transitions. [2024-11-07 15:08:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 15:08:33,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:33,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:08:33,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:08:33,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:33,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash -68909494, now seen corresponding path program 1 times [2024-11-07 15:08:33,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:33,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262093229] [2024-11-07 15:08:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:33,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:34,139 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 15:08:34,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:34,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262093229] [2024-11-07 15:08:34,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262093229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:34,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:34,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:08:34,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85003765] [2024-11-07 15:08:34,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:34,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:08:34,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:34,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:08:34,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:08:34,141 INFO L87 Difference]: Start difference. First operand 467 states and 663 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 15:08:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:34,292 INFO L93 Difference]: Finished difference Result 1158 states and 1654 transitions. [2024-11-07 15:08:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 15:08:34,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-07 15:08:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:34,296 INFO L225 Difference]: With dead ends: 1158 [2024-11-07 15:08:34,296 INFO L226 Difference]: Without dead ends: 907 [2024-11-07 15:08:34,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 15:08:34,297 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 606 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:34,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 2113 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 15:08:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-07 15:08:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 469. [2024-11-07 15:08:34,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 446 states have (on average 1.4237668161434978) internal successors, (635), 450 states have internal predecessors, (635), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 665 transitions. [2024-11-07 15:08:34,324 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 665 transitions. Word has length 10 [2024-11-07 15:08:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:34,324 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 665 transitions. [2024-11-07 15:08:34,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 15:08:34,324 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 665 transitions. [2024-11-07 15:08:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 15:08:34,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:34,325 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] [2024-11-07 15:08:34,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:08:34,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:34,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:34,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2094545925, now seen corresponding path program 1 times [2024-11-07 15:08:34,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:34,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895648023] [2024-11-07 15:08:34,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:34,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:34,563 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 15:08:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:34,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895648023] [2024-11-07 15:08:34,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895648023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:34,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:34,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:08:34,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240795169] [2024-11-07 15:08:34,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:34,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:08:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:34,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:08:34,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:08:34,565 INFO L87 Difference]: Start difference. First operand 469 states and 665 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:34,636 INFO L93 Difference]: Finished difference Result 892 states and 1260 transitions. [2024-11-07 15:08:34,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:08:34,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-07 15:08:34,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:34,638 INFO L225 Difference]: With dead ends: 892 [2024-11-07 15:08:34,638 INFO L226 Difference]: Without dead ends: 427 [2024-11-07 15:08:34,639 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 15:08:34,640 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 36 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:34,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1660 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 15:08:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-07 15:08:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2024-11-07 15:08:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.381188118811881) internal successors, (558), 408 states have internal predecessors, (558), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 588 transitions. [2024-11-07 15:08:34,650 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 588 transitions. Word has length 66 [2024-11-07 15:08:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:34,650 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 588 transitions. [2024-11-07 15:08:34,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 588 transitions. [2024-11-07 15:08:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 15:08:34,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:34,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:08:34,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:08:34,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:34,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1762783129, now seen corresponding path program 1 times [2024-11-07 15:08:34,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:34,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710139184] [2024-11-07 15:08:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:34,759 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 15:08:34,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:34,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710139184] [2024-11-07 15:08:34,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710139184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:34,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:34,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:08:34,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149818279] [2024-11-07 15:08:34,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:34,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:08:34,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:34,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:08:34,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:08:34,761 INFO L87 Difference]: Start difference. First operand 427 states and 588 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:34,810 INFO L93 Difference]: Finished difference Result 844 states and 1166 transitions. [2024-11-07 15:08:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:08:34,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-07 15:08:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:34,813 INFO L225 Difference]: With dead ends: 844 [2024-11-07 15:08:34,813 INFO L226 Difference]: Without dead ends: 421 [2024-11-07 15:08:34,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 15:08:34,814 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 9 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:34,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1661 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 15:08:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-07 15:08:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-07 15:08:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 402 states have internal predecessors, (548), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 578 transitions. [2024-11-07 15:08:34,824 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 578 transitions. Word has length 66 [2024-11-07 15:08:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:34,825 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 578 transitions. [2024-11-07 15:08:34,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 578 transitions. [2024-11-07 15:08:34,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 15:08:34,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:34,826 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] [2024-11-07 15:08:34,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:08:34,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:34,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1018233745, now seen corresponding path program 1 times [2024-11-07 15:08:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:34,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586732846] [2024-11-07 15:08:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:34,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:35,218 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 15:08:35,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:35,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586732846] [2024-11-07 15:08:35,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586732846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:35,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:35,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 15:08:35,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798382385] [2024-11-07 15:08:35,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:35,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:08:35,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:35,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:08:35,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:08:35,221 INFO L87 Difference]: Start difference. First operand 421 states and 578 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:35,545 INFO L93 Difference]: Finished difference Result 843 states and 1160 transitions. [2024-11-07 15:08:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:08:35,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-07 15:08:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:35,547 INFO L225 Difference]: With dead ends: 843 [2024-11-07 15:08:35,547 INFO L226 Difference]: Without dead ends: 426 [2024-11-07 15:08:35,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:08:35,548 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 10 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2512 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:35,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2512 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 15:08:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-07 15:08:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 423. [2024-11-07 15:08:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 400 states have (on average 1.375) internal successors, (550), 404 states have internal predecessors, (550), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 580 transitions. [2024-11-07 15:08:35,558 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 580 transitions. Word has length 66 [2024-11-07 15:08:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:35,558 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 580 transitions. [2024-11-07 15:08:35,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 580 transitions. [2024-11-07 15:08:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 15:08:35,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:35,560 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] [2024-11-07 15:08:35,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:08:35,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:35,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:35,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2097980756, now seen corresponding path program 1 times [2024-11-07 15:08:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:35,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272423569] [2024-11-07 15:08:35,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:35,765 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 15:08:35,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:35,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272423569] [2024-11-07 15:08:35,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272423569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:35,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:35,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:08:35,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715552391] [2024-11-07 15:08:35,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:35,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:08:35,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:08:35,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:08:35,767 INFO L87 Difference]: Start difference. First operand 423 states and 580 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:35,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:35,859 INFO L93 Difference]: Finished difference Result 842 states and 1156 transitions. [2024-11-07 15:08:35,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 15:08:35,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-07 15:08:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:35,861 INFO L225 Difference]: With dead ends: 842 [2024-11-07 15:08:35,861 INFO L226 Difference]: Without dead ends: 423 [2024-11-07 15:08:35,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:08:35,862 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 13 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:35,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1573 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 15:08:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-07 15:08:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2024-11-07 15:08:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 400 states have (on average 1.3725) internal successors, (549), 404 states have internal predecessors, (549), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 579 transitions. [2024-11-07 15:08:35,870 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 579 transitions. Word has length 67 [2024-11-07 15:08:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:35,871 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 579 transitions. [2024-11-07 15:08:35,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 579 transitions. [2024-11-07 15:08:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 15:08:35,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:35,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:08:35,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:08:35,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:35,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash 362380824, now seen corresponding path program 1 times [2024-11-07 15:08:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:35,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212799630] [2024-11-07 15:08:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:36,054 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 15:08:36,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:36,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212799630] [2024-11-07 15:08:36,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212799630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:36,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:36,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:08:36,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218123856] [2024-11-07 15:08:36,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:36,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:08:36,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:36,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:08:36,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:08:36,056 INFO L87 Difference]: Start difference. First operand 423 states and 579 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:36,308 INFO L93 Difference]: Finished difference Result 847 states and 1162 transitions. [2024-11-07 15:08:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:08:36,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-07 15:08:36,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:36,310 INFO L225 Difference]: With dead ends: 847 [2024-11-07 15:08:36,310 INFO L226 Difference]: Without dead ends: 428 [2024-11-07 15:08:36,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:08:36,311 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 10 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:36,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3014 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:08:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-07 15:08:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 427. [2024-11-07 15:08:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.3712871287128714) internal successors, (554), 408 states have internal predecessors, (554), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 584 transitions. [2024-11-07 15:08:36,320 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 584 transitions. Word has length 67 [2024-11-07 15:08:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:36,320 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 584 transitions. [2024-11-07 15:08:36,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 584 transitions. [2024-11-07 15:08:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 15:08:36,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:36,322 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] [2024-11-07 15:08:36,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:08:36,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:36,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:36,322 INFO L85 PathProgramCache]: Analyzing trace with hash 543599956, now seen corresponding path program 1 times [2024-11-07 15:08:36,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:36,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411038853] [2024-11-07 15:08:36,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:36,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:36,547 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 15:08:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411038853] [2024-11-07 15:08:36,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411038853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:36,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:36,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 15:08:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103177271] [2024-11-07 15:08:36,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:36,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:08:36,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:36,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:08:36,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:08:36,549 INFO L87 Difference]: Start difference. First operand 427 states and 584 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:36,749 INFO L93 Difference]: Finished difference Result 853 states and 1169 transitions. [2024-11-07 15:08:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:08:36,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 15:08:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:36,752 INFO L225 Difference]: With dead ends: 853 [2024-11-07 15:08:36,752 INFO L226 Difference]: Without dead ends: 430 [2024-11-07 15:08:36,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:08:36,753 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 4 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:36,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2061 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:08:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-07 15:08:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2024-11-07 15:08:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 407 states have (on average 1.3685503685503686) internal successors, (557), 411 states have internal predecessors, (557), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 587 transitions. [2024-11-07 15:08:36,762 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 587 transitions. Word has length 68 [2024-11-07 15:08:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:36,762 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 587 transitions. [2024-11-07 15:08:36,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 587 transitions. [2024-11-07 15:08:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 15:08:36,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:36,763 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] [2024-11-07 15:08:36,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:08:36,764 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:36,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:36,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2064596987, now seen corresponding path program 1 times [2024-11-07 15:08:36,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:36,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393415043] [2024-11-07 15:08:36,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:36,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:37,166 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 15:08:37,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:37,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393415043] [2024-11-07 15:08:37,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393415043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:37,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:37,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:08:37,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993173015] [2024-11-07 15:08:37,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:37,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:08:37,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:37,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:08:37,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:08:37,168 INFO L87 Difference]: Start difference. First operand 430 states and 587 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:37,588 INFO L93 Difference]: Finished difference Result 869 states and 1191 transitions. [2024-11-07 15:08:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 15:08:37,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 15:08:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:37,590 INFO L225 Difference]: With dead ends: 869 [2024-11-07 15:08:37,590 INFO L226 Difference]: Without dead ends: 443 [2024-11-07 15:08:37,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 15:08:37,591 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 30 mSDsluCounter, 3509 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4065 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:37,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4065 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 15:08:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-07 15:08:37,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2024-11-07 15:08:37,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 417 states have (on average 1.369304556354916) internal successors, (571), 421 states have internal predecessors, (571), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 601 transitions. [2024-11-07 15:08:37,602 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 601 transitions. Word has length 68 [2024-11-07 15:08:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:37,603 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 601 transitions. [2024-11-07 15:08:37,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 601 transitions. [2024-11-07 15:08:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 15:08:37,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:37,604 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] [2024-11-07 15:08:37,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:08:37,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:37,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:37,605 INFO L85 PathProgramCache]: Analyzing trace with hash -617699308, now seen corresponding path program 1 times [2024-11-07 15:08:37,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:37,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003827746] [2024-11-07 15:08:37,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:37,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:37,955 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 15:08:37,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:37,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003827746] [2024-11-07 15:08:37,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003827746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:37,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:37,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:08:37,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14084247] [2024-11-07 15:08:37,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:37,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:08:37,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:37,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:08:37,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:08:37,956 INFO L87 Difference]: Start difference. First operand 440 states and 601 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:38,206 INFO L93 Difference]: Finished difference Result 879 states and 1203 transitions. [2024-11-07 15:08:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 15:08:38,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 15:08:38,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:38,208 INFO L225 Difference]: With dead ends: 879 [2024-11-07 15:08:38,208 INFO L226 Difference]: Without dead ends: 443 [2024-11-07 15:08:38,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:08:38,209 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 23 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3068 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:38,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3068 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:08:38,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-07 15:08:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-11-07 15:08:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 420 states have (on average 1.3666666666666667) internal successors, (574), 424 states have internal predecessors, (574), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 604 transitions. [2024-11-07 15:08:38,218 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 604 transitions. Word has length 68 [2024-11-07 15:08:38,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:38,218 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 604 transitions. [2024-11-07 15:08:38,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 604 transitions. [2024-11-07 15:08:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 15:08:38,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:38,219 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] [2024-11-07 15:08:38,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:08:38,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:38,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1880623215, now seen corresponding path program 1 times [2024-11-07 15:08:38,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:38,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321328982] [2024-11-07 15:08:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:38,462 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 15:08:38,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:38,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321328982] [2024-11-07 15:08:38,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321328982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:38,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:38,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:08:38,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547358158] [2024-11-07 15:08:38,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:38,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:08:38,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:08:38,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:08:38,464 INFO L87 Difference]: Start difference. First operand 443 states and 604 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:38,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:38,747 INFO L93 Difference]: Finished difference Result 887 states and 1212 transitions. [2024-11-07 15:08:38,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:08:38,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 15:08:38,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:38,751 INFO L225 Difference]: With dead ends: 887 [2024-11-07 15:08:38,751 INFO L226 Difference]: Without dead ends: 448 [2024-11-07 15:08:38,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:08:38,753 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 9 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3020 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:38,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3020 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:08:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-07 15:08:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 443. [2024-11-07 15:08:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 420 states have (on average 1.3666666666666667) internal successors, (574), 424 states have internal predecessors, (574), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 604 transitions. [2024-11-07 15:08:38,767 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 604 transitions. Word has length 69 [2024-11-07 15:08:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:38,767 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 604 transitions. [2024-11-07 15:08:38,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 604 transitions. [2024-11-07 15:08:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 15:08:38,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:38,768 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] [2024-11-07 15:08:38,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:08:38,768 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:38,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:38,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1143892763, now seen corresponding path program 1 times [2024-11-07 15:08:38,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:38,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656085531] [2024-11-07 15:08:38,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:38,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:39,168 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 15:08:39,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:39,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656085531] [2024-11-07 15:08:39,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656085531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:39,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:39,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:08:39,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169693851] [2024-11-07 15:08:39,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:39,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:08:39,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:39,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:08:39,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:08:39,169 INFO L87 Difference]: Start difference. First operand 443 states and 604 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:40,085 INFO L93 Difference]: Finished difference Result 1279 states and 1758 transitions. [2024-11-07 15:08:40,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:08:40,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 15:08:40,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:40,089 INFO L225 Difference]: With dead ends: 1279 [2024-11-07 15:08:40,089 INFO L226 Difference]: Without dead ends: 840 [2024-11-07 15:08:40,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-07 15:08:40,090 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 649 mSDsluCounter, 3704 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 4347 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:40,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 4347 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 15:08:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-07 15:08:40,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 475. [2024-11-07 15:08:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 452 states have (on average 1.3407079646017699) internal successors, (606), 456 states have internal predecessors, (606), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 636 transitions. [2024-11-07 15:08:40,104 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 636 transitions. Word has length 69 [2024-11-07 15:08:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:40,104 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 636 transitions. [2024-11-07 15:08:40,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 636 transitions. [2024-11-07 15:08:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 15:08:40,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:40,105 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] [2024-11-07 15:08:40,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:08:40,106 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:40,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash -251769952, now seen corresponding path program 1 times [2024-11-07 15:08:40,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:40,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556274811] [2024-11-07 15:08:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:40,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:40,294 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 15:08:40,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:40,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556274811] [2024-11-07 15:08:40,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556274811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:40,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:40,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:08:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030261934] [2024-11-07 15:08:40,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:40,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:08:40,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:08:40,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:08:40,296 INFO L87 Difference]: Start difference. First operand 475 states and 636 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:40,521 INFO L93 Difference]: Finished difference Result 924 states and 1250 transitions. [2024-11-07 15:08:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 15:08:40,521 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-07 15:08:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:40,523 INFO L225 Difference]: With dead ends: 924 [2024-11-07 15:08:40,523 INFO L226 Difference]: Without dead ends: 485 [2024-11-07 15:08:40,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:08:40,525 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 16 mSDsluCounter, 2554 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3109 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:40,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3109 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:08:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-07 15:08:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 478. [2024-11-07 15:08:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 455 states have (on average 1.3406593406593406) internal successors, (610), 459 states have internal predecessors, (610), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 640 transitions. [2024-11-07 15:08:40,537 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 640 transitions. Word has length 70 [2024-11-07 15:08:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:40,537 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 640 transitions. [2024-11-07 15:08:40,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 640 transitions. [2024-11-07 15:08:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 15:08:40,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:40,537 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] [2024-11-07 15:08:40,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:08:40,537 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:40,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1885470852, now seen corresponding path program 1 times [2024-11-07 15:08:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:40,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594993772] [2024-11-07 15:08:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:40,772 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 15:08:40,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:40,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594993772] [2024-11-07 15:08:40,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594993772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:40,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:40,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:08:40,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560186839] [2024-11-07 15:08:40,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:40,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:08:40,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:40,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:08:40,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:08:40,774 INFO L87 Difference]: Start difference. First operand 478 states and 640 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:41,169 INFO L93 Difference]: Finished difference Result 930 states and 1258 transitions. [2024-11-07 15:08:41,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:08:41,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-07 15:08:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:41,172 INFO L225 Difference]: With dead ends: 930 [2024-11-07 15:08:41,172 INFO L226 Difference]: Without dead ends: 488 [2024-11-07 15:08:41,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:08:41,173 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 26 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:41,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4001 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 15:08:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-07 15:08:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 478. [2024-11-07 15:08:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 455 states have (on average 1.3406593406593406) internal successors, (610), 459 states have internal predecessors, (610), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 640 transitions. [2024-11-07 15:08:41,186 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 640 transitions. Word has length 70 [2024-11-07 15:08:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:41,186 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 640 transitions. [2024-11-07 15:08:41,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 640 transitions. [2024-11-07 15:08:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:08:41,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:41,187 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] [2024-11-07 15:08:41,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:08:41,187 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:41,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:41,188 INFO L85 PathProgramCache]: Analyzing trace with hash 100457695, now seen corresponding path program 1 times [2024-11-07 15:08:41,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:41,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391395648] [2024-11-07 15:08:41,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:41,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:41,410 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 15:08:41,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:41,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391395648] [2024-11-07 15:08:41,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391395648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:41,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:41,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:08:41,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305041919] [2024-11-07 15:08:41,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:41,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:08:41,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:41,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:08:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:08:41,412 INFO L87 Difference]: Start difference. First operand 478 states and 640 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:41,756 INFO L93 Difference]: Finished difference Result 936 states and 1267 transitions. [2024-11-07 15:08:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:08:41,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 15:08:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:41,759 INFO L225 Difference]: With dead ends: 936 [2024-11-07 15:08:41,759 INFO L226 Difference]: Without dead ends: 494 [2024-11-07 15:08:41,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 15:08:41,761 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 22 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:41,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4056 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 15:08:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-07 15:08:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2024-11-07 15:08:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 465 states have (on average 1.3376344086021505) internal successors, (622), 469 states have internal predecessors, (622), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 652 transitions. [2024-11-07 15:08:41,772 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 652 transitions. Word has length 71 [2024-11-07 15:08:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:41,773 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 652 transitions. [2024-11-07 15:08:41,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 652 transitions. [2024-11-07 15:08:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:08:41,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:41,773 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] [2024-11-07 15:08:41,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:08:41,773 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:41,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:41,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1930413179, now seen corresponding path program 1 times [2024-11-07 15:08:41,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:41,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792659166] [2024-11-07 15:08:41,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:41,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:41,978 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 15:08:41,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:41,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792659166] [2024-11-07 15:08:41,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792659166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:41,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:41,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:08:41,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927450653] [2024-11-07 15:08:41,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:41,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:08:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:41,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:08:41,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:08:41,980 INFO L87 Difference]: Start difference. First operand 488 states and 652 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:42,335 INFO L93 Difference]: Finished difference Result 956 states and 1291 transitions. [2024-11-07 15:08:42,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:08:42,336 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 15:08:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:42,338 INFO L225 Difference]: With dead ends: 956 [2024-11-07 15:08:42,338 INFO L226 Difference]: Without dead ends: 504 [2024-11-07 15:08:42,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:08:42,339 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 13 mSDsluCounter, 3984 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4532 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:42,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4532 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 15:08:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-07 15:08:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 491. [2024-11-07 15:08:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 468 states have (on average 1.3376068376068375) internal successors, (626), 472 states have internal predecessors, (626), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 656 transitions. [2024-11-07 15:08:42,370 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 656 transitions. Word has length 71 [2024-11-07 15:08:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:42,371 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 656 transitions. [2024-11-07 15:08:42,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 656 transitions. [2024-11-07 15:08:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:08:42,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:42,372 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] [2024-11-07 15:08:42,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:08:42,372 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:42,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:42,372 INFO L85 PathProgramCache]: Analyzing trace with hash 432360443, now seen corresponding path program 1 times [2024-11-07 15:08:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:42,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131386296] [2024-11-07 15:08:42,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:42,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:42,585 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 15:08:42,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:42,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131386296] [2024-11-07 15:08:42,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131386296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:42,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:42,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:08:42,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831534650] [2024-11-07 15:08:42,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:42,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:08:42,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:42,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:08:42,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:08:42,588 INFO L87 Difference]: Start difference. First operand 491 states and 656 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:42,876 INFO L93 Difference]: Finished difference Result 951 states and 1281 transitions. [2024-11-07 15:08:42,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:08:42,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 15:08:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:42,878 INFO L225 Difference]: With dead ends: 951 [2024-11-07 15:08:42,878 INFO L226 Difference]: Without dead ends: 496 [2024-11-07 15:08:42,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:08:42,879 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 7 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3044 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:42,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3044 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 15:08:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-07 15:08:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 491. [2024-11-07 15:08:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 468 states have (on average 1.3354700854700854) internal successors, (625), 472 states have internal predecessors, (625), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 655 transitions. [2024-11-07 15:08:42,889 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 655 transitions. Word has length 71 [2024-11-07 15:08:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:42,890 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 655 transitions. [2024-11-07 15:08:42,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 655 transitions. [2024-11-07 15:08:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:08:42,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:42,890 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] [2024-11-07 15:08:42,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:08:42,891 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:42,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:42,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2045031444, now seen corresponding path program 1 times [2024-11-07 15:08:42,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:42,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474917482] [2024-11-07 15:08:42,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:42,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:43,056 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 15:08:43,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:43,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474917482] [2024-11-07 15:08:43,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474917482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:43,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:43,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:08:43,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183613915] [2024-11-07 15:08:43,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:43,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:08:43,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:43,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:08:43,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:08:43,058 INFO L87 Difference]: Start difference. First operand 491 states and 655 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:43,293 INFO L93 Difference]: Finished difference Result 949 states and 1279 transitions. [2024-11-07 15:08:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:08:43,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 15:08:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:43,295 INFO L225 Difference]: With dead ends: 949 [2024-11-07 15:08:43,295 INFO L226 Difference]: Without dead ends: 494 [2024-11-07 15:08:43,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:08:43,296 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 4 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3003 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:43,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3003 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:08:43,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-07 15:08:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2024-11-07 15:08:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 471 states have (on average 1.3333333333333333) internal successors, (628), 475 states have internal predecessors, (628), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 658 transitions. [2024-11-07 15:08:43,307 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 658 transitions. Word has length 71 [2024-11-07 15:08:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:43,307 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 658 transitions. [2024-11-07 15:08:43,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 658 transitions. [2024-11-07 15:08:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:08:43,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:43,308 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] [2024-11-07 15:08:43,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:08:43,309 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:43,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:43,309 INFO L85 PathProgramCache]: Analyzing trace with hash -665390877, now seen corresponding path program 1 times [2024-11-07 15:08:43,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:43,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754108649] [2024-11-07 15:08:43,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:43,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:43,580 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 15:08:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754108649] [2024-11-07 15:08:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754108649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:43,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:43,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:08:43,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775761937] [2024-11-07 15:08:43,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:43,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:08:43,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:43,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:08:43,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:08:43,581 INFO L87 Difference]: Start difference. First operand 494 states and 658 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:44,488 INFO L93 Difference]: Finished difference Result 964 states and 1298 transitions. [2024-11-07 15:08:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:08:44,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-07 15:08:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:44,490 INFO L225 Difference]: With dead ends: 964 [2024-11-07 15:08:44,490 INFO L226 Difference]: Without dead ends: 506 [2024-11-07 15:08:44,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:08:44,491 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 9 mSDsluCounter, 3483 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4042 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:44,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4042 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 15:08:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-07 15:08:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 498. [2024-11-07 15:08:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 475 states have (on average 1.3326315789473684) internal successors, (633), 479 states have internal predecessors, (633), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 663 transitions. [2024-11-07 15:08:44,508 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 663 transitions. Word has length 72 [2024-11-07 15:08:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:44,508 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 663 transitions. [2024-11-07 15:08:44,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 663 transitions. [2024-11-07 15:08:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:08:44,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:44,510 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] [2024-11-07 15:08:44,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 15:08:44,511 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:44,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1263182800, now seen corresponding path program 1 times [2024-11-07 15:08:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:44,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181692460] [2024-11-07 15:08:44,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:44,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:44,760 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 15:08:44,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:44,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181692460] [2024-11-07 15:08:44,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181692460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:44,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:44,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 15:08:44,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030065144] [2024-11-07 15:08:44,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:44,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:08:44,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:44,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:08:44,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:08:44,761 INFO L87 Difference]: Start difference. First operand 498 states and 663 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:45,178 INFO L93 Difference]: Finished difference Result 973 states and 1308 transitions. [2024-11-07 15:08:45,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:08:45,178 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-07 15:08:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:45,180 INFO L225 Difference]: With dead ends: 973 [2024-11-07 15:08:45,180 INFO L226 Difference]: Without dead ends: 511 [2024-11-07 15:08:45,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:08:45,181 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 22 mSDsluCounter, 4526 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 5082 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:45,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 5082 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 15:08:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-07 15:08:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 501. [2024-11-07 15:08:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 478 states have (on average 1.3305439330543933) internal successors, (636), 482 states have internal predecessors, (636), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 666 transitions. [2024-11-07 15:08:45,194 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 666 transitions. Word has length 72 [2024-11-07 15:08:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:45,194 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 666 transitions. [2024-11-07 15:08:45,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 666 transitions. [2024-11-07 15:08:45,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:08:45,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:45,196 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] [2024-11-07 15:08:45,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 15:08:45,196 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:45,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:45,197 INFO L85 PathProgramCache]: Analyzing trace with hash 228654279, now seen corresponding path program 1 times [2024-11-07 15:08:45,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:45,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509340570] [2024-11-07 15:08:45,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:45,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:45,667 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 15:08:45,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:45,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509340570] [2024-11-07 15:08:45,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509340570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:45,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:45,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:08:45,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010389180] [2024-11-07 15:08:45,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:45,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:08:45,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:45,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:08:45,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:08:45,669 INFO L87 Difference]: Start difference. First operand 501 states and 666 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:46,428 INFO L93 Difference]: Finished difference Result 972 states and 1304 transitions. [2024-11-07 15:08:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:08:46,429 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-07 15:08:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:46,431 INFO L225 Difference]: With dead ends: 972 [2024-11-07 15:08:46,431 INFO L226 Difference]: Without dead ends: 507 [2024-11-07 15:08:46,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-07 15:08:46,433 INFO L432 NwaCegarLoop]: 553 mSDtfsCounter, 33 mSDsluCounter, 3418 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3971 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:46,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3971 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 15:08:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-07 15:08:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 502. [2024-11-07 15:08:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 479 states have (on average 1.3298538622129437) internal successors, (637), 483 states have internal predecessors, (637), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 667 transitions. [2024-11-07 15:08:46,445 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 667 transitions. Word has length 72 [2024-11-07 15:08:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:46,446 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 667 transitions. [2024-11-07 15:08:46,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:46,447 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 667 transitions. [2024-11-07 15:08:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:08:46,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:46,447 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] [2024-11-07 15:08:46,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 15:08:46,447 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:46,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1607808641, now seen corresponding path program 1 times [2024-11-07 15:08:46,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:46,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531686913] [2024-11-07 15:08:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:46,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:46,633 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 15:08:46,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:08:46,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531686913] [2024-11-07 15:08:46,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531686913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:08:46,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:08:46,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:08:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974664876] [2024-11-07 15:08:46,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:08:46,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:08:46,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:08:46,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:08:46,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:08:46,635 INFO L87 Difference]: Start difference. First operand 502 states and 667 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:08:47,032 INFO L93 Difference]: Finished difference Result 977 states and 1311 transitions. [2024-11-07 15:08:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:08:47,033 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-07 15:08:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:08:47,035 INFO L225 Difference]: With dead ends: 977 [2024-11-07 15:08:47,035 INFO L226 Difference]: Without dead ends: 511 [2024-11-07 15:08:47,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:08:47,040 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 22 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:08:47,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4001 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 15:08:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-07 15:08:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 499. [2024-11-07 15:08:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 476 states have (on average 1.3319327731092436) internal successors, (634), 480 states have internal predecessors, (634), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 15:08:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 664 transitions. [2024-11-07 15:08:47,064 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 664 transitions. Word has length 72 [2024-11-07 15:08:47,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:08:47,064 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 664 transitions. [2024-11-07 15:08:47,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:08:47,064 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 664 transitions. [2024-11-07 15:08:47,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:08:47,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:08:47,065 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] [2024-11-07 15:08:47,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 15:08:47,065 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:08:47,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:08:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2084167451, now seen corresponding path program 1 times [2024-11-07 15:08:47,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:08:47,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537408228] [2024-11-07 15:08:47,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:08:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:08:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:08:59,382 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 15:09:04,529 WARN L286 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 15:09:10,832 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 15:09:37,970 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 15:09:37,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:09:37,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537408228] [2024-11-07 15:09:37,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537408228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:09:37,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:09:37,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 15:09:37,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631013855] [2024-11-07 15:09:37,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:09:37,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:09:37,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:09:37,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:09:37,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=83, Unknown=5, NotChecked=0, Total=110 [2024-11-07 15:09:37,972 INFO L87 Difference]: Start difference. First operand 499 states and 664 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:09:42,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:09:44,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:09:45,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:09:46,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:09:49,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:09:53,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:09:57,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:10:01,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:10:05,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:10:09,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []