./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_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_JEN_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', '4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193'] 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_JEN_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 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:01:11,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:01:11,281 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:01:11,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:01:11,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:01:11,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:01:11,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:01:11,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:01:11,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 15:01:11,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 15:01:11,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:01:11,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:01:11,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:01:11,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:01:11,324 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:01:11,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:01:11,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:01:11,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:01:11,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:01:11,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:01:11,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:01:11,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:01:11,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:01:11,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:01:11,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:01:11,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:01:11,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:01:11,326 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:01:11,326 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:01:11,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:01:11,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 15:01:11,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:01:11,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:01:11,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:01:11,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:01:11,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:01:11,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:01:11,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:01:11,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:01:11,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:01:11,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:01:11,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:01:11,328 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 -> 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 [2024-11-07 15:01:11,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:01:11,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:01:11,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:01:11,620 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:01:11,621 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:01:11,621 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_JEN_test6-2.i [2024-11-07 15:01:12,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:01:13,318 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:01:13,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-11-07 15:01:13,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63a7c0c9c/9df8173c71344d80b0aaf9a5740c4cb0/FLAG9357a22a7 [2024-11-07 15:01:13,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63a7c0c9c/9df8173c71344d80b0aaf9a5740c4cb0 [2024-11-07 15:01:13,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:01:13,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:01:13,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:01:13,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:01:13,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:01:13,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:01:13" (1/1) ... [2024-11-07 15:01:13,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d722586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:13, skipping insertion in model container [2024-11-07 15:01:13,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:01:13" (1/1) ... [2024-11-07 15:01:13,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:01:13,842 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_JEN_test6-2.i[44118,44131] [2024-11-07 15:01:13,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_JEN_test6-2.i[44660,44673] [2024-11-07 15:01:13,969 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_JEN_test6-2.i[56247,56260] [2024-11-07 15:01:13,970 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_JEN_test6-2.i[56368,56381] [2024-11-07 15:01:13,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:01:13,996 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:01:14,045 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_JEN_test6-2.i[44118,44131] [2024-11-07 15:01:14,049 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_JEN_test6-2.i[44660,44673] [2024-11-07 15:01:14,114 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_JEN_test6-2.i[56247,56260] [2024-11-07 15:01:14,114 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_JEN_test6-2.i[56368,56381] [2024-11-07 15:01:14,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:01:14,182 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:01:14,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:14 WrapperNode [2024-11-07 15:01:14,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:01:14,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:01:14,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:01:14,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:01:14,188 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:01:14" (1/1) ... [2024-11-07 15:01:14,233 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:01:14" (1/1) ... [2024-11-07 15:01:14,285 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1647 [2024-11-07 15:01:14,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:01:14,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:01:14,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:01:14,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:01:14,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:14" (1/1) ... [2024-11-07 15:01:14,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:14" (1/1) ... [2024-11-07 15:01:14,312 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:14" (1/1) ... [2024-11-07 15:01:14,408 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:01:14,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:14" (1/1) ... [2024-11-07 15:01:14,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:14" (1/1) ... [2024-11-07 15:01:14,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:14" (1/1) ... [2024-11-07 15:01:14,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:14" (1/1) ... [2024-11-07 15:01:14,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:14" (1/1) ... [2024-11-07 15:01:14,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:14" (1/1) ... [2024-11-07 15:01:14,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:01:14,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:01:14,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:01:14,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:01:14,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:14" (1/1) ... [2024-11-07 15:01:14,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:01:14,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:01:14,547 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:01:14,553 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:01:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 15:01:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 15:01:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 15:01:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 15:01:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 15:01:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 15:01:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-07 15:01:14,570 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-07 15:01:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 15:01:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 15:01:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 15:01:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 15:01:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 15:01:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 15:01:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 15:01:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 15:01:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 15:01:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 15:01:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:01:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:01:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-07 15:01:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-07 15:01:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 15:01:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 15:01:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 15:01:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 15:01:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-07 15:01:14,576 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-07 15:01:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 15:01:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 15:01:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 15:01:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 15:01:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:01:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:01:14,814 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:01:14,816 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:01:16,249 INFO L? ?]: Removed 364 outVars from TransFormulas that were not future-live. [2024-11-07 15:01:16,249 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:01:16,270 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:01:16,273 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-07 15:01:16,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:01:16 BoogieIcfgContainer [2024-11-07 15:01:16,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:01:16,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:01:16,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:01:16,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:01:16,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:01:13" (1/3) ... [2024-11-07 15:01:16,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4509c86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:01:16, skipping insertion in model container [2024-11-07 15:01:16,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:14" (2/3) ... [2024-11-07 15:01:16,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4509c86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:01:16, skipping insertion in model container [2024-11-07 15:01:16,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:01:16" (3/3) ... [2024-11-07 15:01:16,283 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-2.i [2024-11-07 15:01:16,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:01:16,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 15:01:16,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:01:16,379 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;@1f676772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:01:16,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 15:01:16,387 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:01:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 15:01:16,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:16,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:01:16,395 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:01:16,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1705359720, now seen corresponding path program 1 times [2024-11-07 15:01:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:16,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872108857] [2024-11-07 15:01:16,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:16,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:16,595 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:01:16,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:16,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872108857] [2024-11-07 15:01:16,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872108857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:16,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:16,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:01:16,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838487509] [2024-11-07 15:01:16,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:16,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:01:16,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:16,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:01:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:01:16,623 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:01:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:16,690 INFO L93 Difference]: Finished difference Result 943 states and 1508 transitions. [2024-11-07 15:01:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:01:16,691 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:01:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:16,708 INFO L225 Difference]: With dead ends: 943 [2024-11-07 15:01:16,708 INFO L226 Difference]: Without dead ends: 467 [2024-11-07 15:01:16,714 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:01:16,719 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:01:16,722 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:01:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-07 15:01:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2024-11-07 15:01:16,781 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:01:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 663 transitions. [2024-11-07 15:01:16,790 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 663 transitions. Word has length 8 [2024-11-07 15:01:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:16,791 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 663 transitions. [2024-11-07 15:01:16,791 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:01:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 663 transitions. [2024-11-07 15:01:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 15:01:16,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:16,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:01:16,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:01:16,792 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:01:16,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash -68909494, now seen corresponding path program 1 times [2024-11-07 15:01:16,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:16,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970940468] [2024-11-07 15:01:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:16,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:17,035 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:01:17,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:17,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970940468] [2024-11-07 15:01:17,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970940468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:17,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:17,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:01:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125940443] [2024-11-07 15:01:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:17,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:01:17,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:17,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:01:17,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:01:17,039 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:01:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:17,239 INFO L93 Difference]: Finished difference Result 1158 states and 1654 transitions. [2024-11-07 15:01:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 15:01:17,239 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:01:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:17,245 INFO L225 Difference]: With dead ends: 1158 [2024-11-07 15:01:17,245 INFO L226 Difference]: Without dead ends: 907 [2024-11-07 15:01:17,247 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:01:17,249 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:01:17,249 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:01:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-07 15:01:17,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 469. [2024-11-07 15:01:17,284 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:01:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 665 transitions. [2024-11-07 15:01:17,287 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 665 transitions. Word has length 10 [2024-11-07 15:01:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:17,288 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 665 transitions. [2024-11-07 15:01:17,288 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:01:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 665 transitions. [2024-11-07 15:01:17,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 15:01:17,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:17,291 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:01:17,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:01:17,292 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:01:17,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2094545925, now seen corresponding path program 1 times [2024-11-07 15:01:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429247374] [2024-11-07 15:01:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:17,643 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:01:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:17,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429247374] [2024-11-07 15:01:17,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429247374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:17,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:17,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:01:17,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230042922] [2024-11-07 15:01:17,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:17,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:01:17,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:17,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:01:17,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:01:17,646 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:01:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:17,741 INFO L93 Difference]: Finished difference Result 892 states and 1260 transitions. [2024-11-07 15:01:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:01:17,742 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:01:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:17,745 INFO L225 Difference]: With dead ends: 892 [2024-11-07 15:01:17,748 INFO L226 Difference]: Without dead ends: 427 [2024-11-07 15:01:17,750 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:01:17,750 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 36 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:01:17,751 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:01:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-07 15:01:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2024-11-07 15:01:17,769 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:01:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 588 transitions. [2024-11-07 15:01:17,772 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 588 transitions. Word has length 66 [2024-11-07 15:01:17,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:17,772 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 588 transitions. [2024-11-07 15:01:17,772 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:01:17,772 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 588 transitions. [2024-11-07 15:01:17,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 15:01:17,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:17,774 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:01:17,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:01:17,774 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:01:17,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:17,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1762783129, now seen corresponding path program 1 times [2024-11-07 15:01:17,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:17,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24224938] [2024-11-07 15:01:17,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:17,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:17,949 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:01:17,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:17,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24224938] [2024-11-07 15:01:17,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24224938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:17,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:17,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:01:17,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519717852] [2024-11-07 15:01:17,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:17,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:01:17,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:17,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:01:17,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:01:17,952 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:01:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:18,015 INFO L93 Difference]: Finished difference Result 844 states and 1166 transitions. [2024-11-07 15:01:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:01:18,015 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:01:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:18,017 INFO L225 Difference]: With dead ends: 844 [2024-11-07 15:01:18,017 INFO L226 Difference]: Without dead ends: 421 [2024-11-07 15:01:18,020 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:01:18,021 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:01:18,021 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:01:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-07 15:01:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-07 15:01:18,036 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:01:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 578 transitions. [2024-11-07 15:01:18,039 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 578 transitions. Word has length 66 [2024-11-07 15:01:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:18,039 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 578 transitions. [2024-11-07 15:01:18,039 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:01:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 578 transitions. [2024-11-07 15:01:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 15:01:18,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:18,043 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:01:18,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:01:18,043 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:01:18,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:18,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1018233745, now seen corresponding path program 1 times [2024-11-07 15:01:18,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:18,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702273517] [2024-11-07 15:01:18,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:18,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:18,477 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:01:18,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:18,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702273517] [2024-11-07 15:01:18,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702273517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:18,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:18,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 15:01:18,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796849724] [2024-11-07 15:01:18,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:18,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:01:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:01:18,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:01:18,479 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:01:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:18,816 INFO L93 Difference]: Finished difference Result 843 states and 1160 transitions. [2024-11-07 15:01:18,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:01:18,817 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:01:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:18,819 INFO L225 Difference]: With dead ends: 843 [2024-11-07 15:01:18,819 INFO L226 Difference]: Without dead ends: 426 [2024-11-07 15:01:18,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:01:18,821 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 10 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:01:18,821 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:01:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-07 15:01:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 423. [2024-11-07 15:01:18,831 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:01:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 580 transitions. [2024-11-07 15:01:18,838 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 580 transitions. Word has length 66 [2024-11-07 15:01:18,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:18,839 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 580 transitions. [2024-11-07 15:01:18,839 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:01:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 580 transitions. [2024-11-07 15:01:18,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 15:01:18,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:18,840 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:01:18,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:01:18,841 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:01:18,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:18,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2097980756, now seen corresponding path program 1 times [2024-11-07 15:01:18,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:18,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997450557] [2024-11-07 15:01:18,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:18,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:19,181 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:01:19,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:19,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997450557] [2024-11-07 15:01:19,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997450557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:19,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:19,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:01:19,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572816858] [2024-11-07 15:01:19,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:19,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:01:19,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:19,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:01:19,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:01:19,183 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:01:19,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:19,308 INFO L93 Difference]: Finished difference Result 842 states and 1156 transitions. [2024-11-07 15:01:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 15:01:19,308 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:01:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:19,311 INFO L225 Difference]: With dead ends: 842 [2024-11-07 15:01:19,311 INFO L226 Difference]: Without dead ends: 423 [2024-11-07 15:01:19,312 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:01:19,313 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:01:19,313 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:01:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-07 15:01:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2024-11-07 15:01:19,326 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:01:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 579 transitions. [2024-11-07 15:01:19,329 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 579 transitions. Word has length 67 [2024-11-07 15:01:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:19,329 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 579 transitions. [2024-11-07 15:01:19,329 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:01:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 579 transitions. [2024-11-07 15:01:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 15:01:19,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:19,331 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:01:19,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:01:19,332 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:01:19,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash 362380824, now seen corresponding path program 1 times [2024-11-07 15:01:19,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:19,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379664238] [2024-11-07 15:01:19,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:19,596 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:01:19,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:19,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379664238] [2024-11-07 15:01:19,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379664238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:19,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:19,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:01:19,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643070926] [2024-11-07 15:01:19,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:19,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:01:19,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:19,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:01:19,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:01:19,599 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:01:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:19,918 INFO L93 Difference]: Finished difference Result 847 states and 1162 transitions. [2024-11-07 15:01:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:01:19,919 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:01:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:19,921 INFO L225 Difference]: With dead ends: 847 [2024-11-07 15:01:19,921 INFO L226 Difference]: Without dead ends: 428 [2024-11-07 15:01:19,922 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:01:19,923 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.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:19,924 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.3s Time] [2024-11-07 15:01:19,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-07 15:01:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 427. [2024-11-07 15:01:19,935 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:01:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 584 transitions. [2024-11-07 15:01:19,938 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 584 transitions. Word has length 67 [2024-11-07 15:01:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:19,938 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 584 transitions. [2024-11-07 15:01:19,938 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:01:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 584 transitions. [2024-11-07 15:01:19,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 15:01:19,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:19,939 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:01:19,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:01:19,940 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:01:19,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash 543599956, now seen corresponding path program 1 times [2024-11-07 15:01:19,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:19,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289572213] [2024-11-07 15:01:19,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:19,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:20,220 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:01:20,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:20,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289572213] [2024-11-07 15:01:20,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289572213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:20,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:20,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 15:01:20,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289293944] [2024-11-07 15:01:20,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:20,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:01:20,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:20,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:01:20,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:01:20,222 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:01:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:20,453 INFO L93 Difference]: Finished difference Result 853 states and 1169 transitions. [2024-11-07 15:01:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:01:20,454 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:01:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:20,457 INFO L225 Difference]: With dead ends: 853 [2024-11-07 15:01:20,457 INFO L226 Difference]: Without dead ends: 430 [2024-11-07 15:01:20,458 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:01:20,459 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:01:20,459 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:01:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-07 15:01:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2024-11-07 15:01:20,474 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:01:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 587 transitions. [2024-11-07 15:01:20,476 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 587 transitions. Word has length 68 [2024-11-07 15:01:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:20,476 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 587 transitions. [2024-11-07 15:01:20,477 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:01:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 587 transitions. [2024-11-07 15:01:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 15:01:20,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:20,478 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:01:20,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:01:20,478 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:01:20,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:20,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2064596987, now seen corresponding path program 1 times [2024-11-07 15:01:20,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:20,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11415140] [2024-11-07 15:01:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:20,898 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:01:20,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:20,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11415140] [2024-11-07 15:01:20,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11415140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:20,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:20,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:01:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420057534] [2024-11-07 15:01:20,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:20,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:01:20,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:20,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:01:20,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:01:20,900 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:01:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:21,375 INFO L93 Difference]: Finished difference Result 869 states and 1191 transitions. [2024-11-07 15:01:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 15:01:21,377 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:01:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:21,380 INFO L225 Difference]: With dead ends: 869 [2024-11-07 15:01:21,380 INFO L226 Difference]: Without dead ends: 443 [2024-11-07 15:01:21,381 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:01:21,381 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:01:21,381 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:01:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-07 15:01:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2024-11-07 15:01:21,393 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:01:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 601 transitions. [2024-11-07 15:01:21,396 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 601 transitions. Word has length 68 [2024-11-07 15:01:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:21,396 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 601 transitions. [2024-11-07 15:01:21,396 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:01:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 601 transitions. [2024-11-07 15:01:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 15:01:21,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:21,397 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:01:21,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:01:21,397 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:01:21,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash -617699308, now seen corresponding path program 1 times [2024-11-07 15:01:21,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:21,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099933656] [2024-11-07 15:01:21,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:21,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:21,864 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:01:21,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:21,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099933656] [2024-11-07 15:01:21,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099933656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:21,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:21,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:01:21,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127673547] [2024-11-07 15:01:21,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:21,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:01:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:21,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:01:21,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:01:21,867 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:01:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:22,211 INFO L93 Difference]: Finished difference Result 879 states and 1203 transitions. [2024-11-07 15:01:22,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 15:01:22,211 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:01:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:22,214 INFO L225 Difference]: With dead ends: 879 [2024-11-07 15:01:22,214 INFO L226 Difference]: Without dead ends: 443 [2024-11-07 15:01:22,215 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:01:22,215 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.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:22,216 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.3s Time] [2024-11-07 15:01:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-07 15:01:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-11-07 15:01:22,251 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:01:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 604 transitions. [2024-11-07 15:01:22,254 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 604 transitions. Word has length 68 [2024-11-07 15:01:22,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:22,254 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 604 transitions. [2024-11-07 15:01:22,254 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:01:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 604 transitions. [2024-11-07 15:01:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 15:01:22,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:22,256 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:01:22,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:01:22,256 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:01:22,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:22,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1880623215, now seen corresponding path program 1 times [2024-11-07 15:01:22,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:22,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60802198] [2024-11-07 15:01:22,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:22,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:22,500 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:01:22,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:22,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60802198] [2024-11-07 15:01:22,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60802198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:22,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:22,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:01:22,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072700265] [2024-11-07 15:01:22,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:22,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:01:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:22,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:01:22,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:01:22,502 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:01:22,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:22,835 INFO L93 Difference]: Finished difference Result 887 states and 1212 transitions. [2024-11-07 15:01:22,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:01:22,835 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:01:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:22,838 INFO L225 Difference]: With dead ends: 887 [2024-11-07 15:01:22,838 INFO L226 Difference]: Without dead ends: 448 [2024-11-07 15:01:22,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:01:22,840 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.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:22,840 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.3s Time] [2024-11-07 15:01:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-07 15:01:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 443. [2024-11-07 15:01:22,851 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:01:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 604 transitions. [2024-11-07 15:01:22,854 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 604 transitions. Word has length 69 [2024-11-07 15:01:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:22,854 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 604 transitions. [2024-11-07 15:01:22,854 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:01:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 604 transitions. [2024-11-07 15:01:22,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 15:01:22,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:22,855 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:01:22,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:01:22,855 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:01:22,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:22,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1143892763, now seen corresponding path program 1 times [2024-11-07 15:01:22,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:22,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632100258] [2024-11-07 15:01:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:22,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:23,500 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:01:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632100258] [2024-11-07 15:01:23,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632100258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:23,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:23,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:01:23,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404173217] [2024-11-07 15:01:23,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:23,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:01:23,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:23,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:01:23,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:01:23,502 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:01:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:24,648 INFO L93 Difference]: Finished difference Result 1279 states and 1758 transitions. [2024-11-07 15:01:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:24,649 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:01:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:24,653 INFO L225 Difference]: With dead ends: 1279 [2024-11-07 15:01:24,653 INFO L226 Difference]: Without dead ends: 840 [2024-11-07 15:01:24,654 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:01:24,655 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 649 mSDsluCounter, 3704 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:24,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 4347 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 15:01:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-07 15:01:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 475. [2024-11-07 15:01:24,672 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:01:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 636 transitions. [2024-11-07 15:01:24,675 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 636 transitions. Word has length 69 [2024-11-07 15:01:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:24,675 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 636 transitions. [2024-11-07 15:01:24,675 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:01:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 636 transitions. [2024-11-07 15:01:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 15:01:24,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:24,676 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:01:24,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:01:24,676 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:01:24,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash -251769952, now seen corresponding path program 1 times [2024-11-07 15:01:24,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:24,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497597129] [2024-11-07 15:01:24,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:24,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:24,985 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:01:24,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:24,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497597129] [2024-11-07 15:01:24,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497597129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:24,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:24,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:01:24,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288221153] [2024-11-07 15:01:24,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:24,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:01:24,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:24,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:01:24,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:01:24,988 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:01:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:25,308 INFO L93 Difference]: Finished difference Result 924 states and 1250 transitions. [2024-11-07 15:01:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 15:01:25,309 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:01:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:25,312 INFO L225 Difference]: With dead ends: 924 [2024-11-07 15:01:25,312 INFO L226 Difference]: Without dead ends: 485 [2024-11-07 15:01:25,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:01:25,314 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.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:25,314 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.3s Time] [2024-11-07 15:01:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-07 15:01:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 478. [2024-11-07 15:01:25,328 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:01:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 640 transitions. [2024-11-07 15:01:25,330 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 640 transitions. Word has length 70 [2024-11-07 15:01:25,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:25,331 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 640 transitions. [2024-11-07 15:01:25,331 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:01:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 640 transitions. [2024-11-07 15:01:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 15:01:25,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:25,332 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:01:25,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:01:25,332 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:01:25,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1885470852, now seen corresponding path program 1 times [2024-11-07 15:01:25,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:25,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036590738] [2024-11-07 15:01:25,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:25,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:25,631 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:01:25,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:25,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036590738] [2024-11-07 15:01:25,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036590738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:25,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:25,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:01:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404461929] [2024-11-07 15:01:25,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:25,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:01:25,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:25,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:01:25,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:01:25,633 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:01:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:26,113 INFO L93 Difference]: Finished difference Result 930 states and 1258 transitions. [2024-11-07 15:01:26,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:26,114 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:01:26,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:26,117 INFO L225 Difference]: With dead ends: 930 [2024-11-07 15:01:26,118 INFO L226 Difference]: Without dead ends: 488 [2024-11-07 15:01:26,119 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:01:26,120 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 26 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:26,120 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.4s Time] [2024-11-07 15:01:26,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-07 15:01:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 478. [2024-11-07 15:01:26,136 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:01:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 640 transitions. [2024-11-07 15:01:26,138 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 640 transitions. Word has length 70 [2024-11-07 15:01:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:26,139 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 640 transitions. [2024-11-07 15:01:26,139 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:01:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 640 transitions. [2024-11-07 15:01:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:01:26,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:26,140 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:01:26,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:01:26,140 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:01:26,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:26,140 INFO L85 PathProgramCache]: Analyzing trace with hash 100457695, now seen corresponding path program 1 times [2024-11-07 15:01:26,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:26,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850882823] [2024-11-07 15:01:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:26,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:01:26,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:26,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850882823] [2024-11-07 15:01:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850882823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:26,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:26,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:01:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128632786] [2024-11-07 15:01:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:26,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:01:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:26,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:01:26,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:01:26,433 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:01:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:26,899 INFO L93 Difference]: Finished difference Result 936 states and 1267 transitions. [2024-11-07 15:01:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:26,900 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:01:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:26,902 INFO L225 Difference]: With dead ends: 936 [2024-11-07 15:01:26,902 INFO L226 Difference]: Without dead ends: 494 [2024-11-07 15:01:26,903 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:01:26,904 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.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:26,904 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.4s Time] [2024-11-07 15:01:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-07 15:01:26,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2024-11-07 15:01:26,918 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:01:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 652 transitions. [2024-11-07 15:01:26,920 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 652 transitions. Word has length 71 [2024-11-07 15:01:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:26,920 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 652 transitions. [2024-11-07 15:01:26,921 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:01:26,921 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 652 transitions. [2024-11-07 15:01:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:01:26,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:26,921 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:01:26,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:01:26,922 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:01:26,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:26,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1930413179, now seen corresponding path program 1 times [2024-11-07 15:01:26,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:26,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51801878] [2024-11-07 15:01:26,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:26,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:27,206 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:01:27,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:27,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51801878] [2024-11-07 15:01:27,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51801878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:27,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:27,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:01:27,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747791547] [2024-11-07 15:01:27,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:27,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:01:27,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:27,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:01:27,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:01:27,208 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:01:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:27,663 INFO L93 Difference]: Finished difference Result 956 states and 1291 transitions. [2024-11-07 15:01:27,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:27,664 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:01:27,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:27,666 INFO L225 Difference]: With dead ends: 956 [2024-11-07 15:01:27,666 INFO L226 Difference]: Without dead ends: 504 [2024-11-07 15:01:27,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:01:27,668 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 13 mSDsluCounter, 3984 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:27,668 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.4s Time] [2024-11-07 15:01:27,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-07 15:01:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 491. [2024-11-07 15:01:27,685 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:01:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 656 transitions. [2024-11-07 15:01:27,689 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 656 transitions. Word has length 71 [2024-11-07 15:01:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:27,689 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 656 transitions. [2024-11-07 15:01:27,689 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:01:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 656 transitions. [2024-11-07 15:01:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:01:27,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:27,691 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:01:27,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:01:27,692 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:01:27,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:27,693 INFO L85 PathProgramCache]: Analyzing trace with hash 432360443, now seen corresponding path program 1 times [2024-11-07 15:01:27,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:27,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954050452] [2024-11-07 15:01:27,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:27,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:01:27,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:27,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954050452] [2024-11-07 15:01:27,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954050452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:27,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:27,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:01:27,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469415324] [2024-11-07 15:01:27,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:27,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:01:27,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:27,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:01:27,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:01:27,989 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:01:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:28,378 INFO L93 Difference]: Finished difference Result 951 states and 1281 transitions. [2024-11-07 15:01:28,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:01:28,379 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:01:28,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:28,382 INFO L225 Difference]: With dead ends: 951 [2024-11-07 15:01:28,382 INFO L226 Difference]: Without dead ends: 496 [2024-11-07 15:01:28,383 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:01:28,384 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 7 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:28,384 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.4s Time] [2024-11-07 15:01:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-07 15:01:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 491. [2024-11-07 15:01:28,400 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:01:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 655 transitions. [2024-11-07 15:01:28,403 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 655 transitions. Word has length 71 [2024-11-07 15:01:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:28,403 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 655 transitions. [2024-11-07 15:01:28,403 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:01:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 655 transitions. [2024-11-07 15:01:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:01:28,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:28,404 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:01:28,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:01:28,405 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:01:28,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:28,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2045031444, now seen corresponding path program 1 times [2024-11-07 15:01:28,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:28,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070266682] [2024-11-07 15:01:28,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:28,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:28,665 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:01:28,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:28,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070266682] [2024-11-07 15:01:28,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070266682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:28,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:28,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:01:28,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574927098] [2024-11-07 15:01:28,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:28,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:01:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:01:28,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:01:28,667 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:01:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:28,992 INFO L93 Difference]: Finished difference Result 949 states and 1279 transitions. [2024-11-07 15:01:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:01:28,993 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:01:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:28,996 INFO L225 Difference]: With dead ends: 949 [2024-11-07 15:01:28,996 INFO L226 Difference]: Without dead ends: 494 [2024-11-07 15:01:28,997 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:01:28,997 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 4 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:28,997 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.3s Time] [2024-11-07 15:01:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-07 15:01:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2024-11-07 15:01:29,010 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:01:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 658 transitions. [2024-11-07 15:01:29,012 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 658 transitions. Word has length 71 [2024-11-07 15:01:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:29,013 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 658 transitions. [2024-11-07 15:01:29,013 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:01:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 658 transitions. [2024-11-07 15:01:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:01:29,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:29,014 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:01:29,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:01:29,014 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:01:29,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:29,015 INFO L85 PathProgramCache]: Analyzing trace with hash -665390877, now seen corresponding path program 1 times [2024-11-07 15:01:29,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:29,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686656401] [2024-11-07 15:01:29,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:29,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:29,485 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:01:29,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:29,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686656401] [2024-11-07 15:01:29,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686656401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:29,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:29,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:01:29,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986827266] [2024-11-07 15:01:29,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:29,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:01:29,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:29,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:01:29,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:01:29,488 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:01:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:30,499 INFO L93 Difference]: Finished difference Result 964 states and 1298 transitions. [2024-11-07 15:01:30,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:30,500 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:01:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:30,503 INFO L225 Difference]: With dead ends: 964 [2024-11-07 15:01:30,503 INFO L226 Difference]: Without dead ends: 506 [2024-11-07 15:01:30,505 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:01:30,506 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 9 mSDsluCounter, 3483 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:30,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4042 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 15:01:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-07 15:01:30,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 498. [2024-11-07 15:01:30,523 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:01:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 663 transitions. [2024-11-07 15:01:30,525 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 663 transitions. Word has length 72 [2024-11-07 15:01:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:30,526 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 663 transitions. [2024-11-07 15:01:30,526 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:01:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 663 transitions. [2024-11-07 15:01:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:01:30,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:30,528 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:01:30,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 15:01:30,529 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:01:30,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:30,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1263182800, now seen corresponding path program 1 times [2024-11-07 15:01:30,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:30,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994432642] [2024-11-07 15:01:30,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:30,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:30,829 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:01:30,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:30,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994432642] [2024-11-07 15:01:30,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994432642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:30,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:30,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 15:01:30,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543310604] [2024-11-07 15:01:30,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:30,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:01:30,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:30,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:01:30,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:01:30,832 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:01:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:31,358 INFO L93 Difference]: Finished difference Result 973 states and 1308 transitions. [2024-11-07 15:01:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:31,359 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:01:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:31,362 INFO L225 Difference]: With dead ends: 973 [2024-11-07 15:01:31,362 INFO L226 Difference]: Without dead ends: 511 [2024-11-07 15:01:31,363 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:01:31,364 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 22 mSDsluCounter, 4526 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:31,366 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.5s Time] [2024-11-07 15:01:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-07 15:01:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 501. [2024-11-07 15:01:31,383 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:01:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 666 transitions. [2024-11-07 15:01:31,386 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 666 transitions. Word has length 72 [2024-11-07 15:01:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:31,386 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 666 transitions. [2024-11-07 15:01:31,386 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:01:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 666 transitions. [2024-11-07 15:01:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:01:31,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:31,388 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:01:31,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 15:01:31,388 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:01:31,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:31,388 INFO L85 PathProgramCache]: Analyzing trace with hash 228654279, now seen corresponding path program 1 times [2024-11-07 15:01:31,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:31,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742119868] [2024-11-07 15:01:31,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:31,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:31,872 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:01:31,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:31,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742119868] [2024-11-07 15:01:31,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742119868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:31,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:31,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:01:31,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671688458] [2024-11-07 15:01:31,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:31,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:01:31,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:31,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:01:31,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:01:31,875 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:01:32,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:32,807 INFO L93 Difference]: Finished difference Result 972 states and 1304 transitions. [2024-11-07 15:01:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:32,808 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:01:32,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:32,812 INFO L225 Difference]: With dead ends: 972 [2024-11-07 15:01:32,812 INFO L226 Difference]: Without dead ends: 507 [2024-11-07 15:01:32,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-07 15:01:32,814 INFO L432 NwaCegarLoop]: 553 mSDtfsCounter, 33 mSDsluCounter, 3418 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:32,814 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.8s Time] [2024-11-07 15:01:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-07 15:01:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 502. [2024-11-07 15:01:32,831 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:01:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 667 transitions. [2024-11-07 15:01:32,835 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 667 transitions. Word has length 72 [2024-11-07 15:01:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:32,836 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 667 transitions. [2024-11-07 15:01:32,836 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:01:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 667 transitions. [2024-11-07 15:01:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:01:32,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:32,837 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:01:32,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 15:01:32,837 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:01:32,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:32,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1607808641, now seen corresponding path program 1 times [2024-11-07 15:01:32,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:32,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724326787] [2024-11-07 15:01:32,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:32,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:33,077 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:01:33,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:33,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724326787] [2024-11-07 15:01:33,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724326787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:33,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:33,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:01:33,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363020630] [2024-11-07 15:01:33,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:33,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:01:33,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:33,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:01:33,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:01:33,080 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:01:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:33,538 INFO L93 Difference]: Finished difference Result 977 states and 1311 transitions. [2024-11-07 15:01:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:33,542 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:01:33,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:33,545 INFO L225 Difference]: With dead ends: 977 [2024-11-07 15:01:33,546 INFO L226 Difference]: Without dead ends: 511 [2024-11-07 15:01:33,547 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:01:33,549 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:01:33,549 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:01:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-07 15:01:33,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 499. [2024-11-07 15:01:33,565 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:01:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 664 transitions. [2024-11-07 15:01:33,568 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 664 transitions. Word has length 72 [2024-11-07 15:01:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:33,568 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 664 transitions. [2024-11-07 15:01:33,568 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:01:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 664 transitions. [2024-11-07 15:01:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:01:33,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:33,569 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:01:33,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 15:01:33,569 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:01:33,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2084167451, now seen corresponding path program 1 times [2024-11-07 15:01:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:33,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492778011] [2024-11-07 15:01:33,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:33,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:56,513 WARN L286 SmtUtils]: Spent 6.11s 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:02:00,525 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2024-11-07 15:02:00,588 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:02:00,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:02:00,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492778011] [2024-11-07 15:02:00,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492778011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:02:00,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:02:00,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 15:02:00,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501048966] [2024-11-07 15:02:00,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:02:00,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:02:00,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:02:00,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:02:00,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-11-07 15:02:00,590 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:02:04,828 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:02:08,838 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:02:13,963 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:02:17,972 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:02:21,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse3 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse0 (+ .cse3 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse6 (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse7 (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059)) (.cse2 (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|)) (.cse4 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse5 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 (mod |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ .cse2 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse3 .cse4 .cse5) 4294967296)) .cse6 .cse7 (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0) (<= 4408680405129836981 (+ .cse6 .cse7 (* (div (+ .cse2 8817360810260198248 .cse3 .cse4 .cse5) 4294967296) 2147483648)))))) is different from false [2024-11-07 15:02:24,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:02:28,924 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:02:33,599 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:02:37,603 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:02:41,607 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 []