./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.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-1.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', '3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3'] 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-1.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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:01:08,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:01:08,430 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:08,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:01:08,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:01:08,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:01:08,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:01:08,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:01:08,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 15:01:08,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 15:01:08,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:01:08,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:01:08,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:01:08,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:01:08,474 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:01:08,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:01:08,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:01:08,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:01:08,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:01:08,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:01:08,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:01:08,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:01:08,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:01:08,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:01:08,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:01:08,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:01:08,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:01:08,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:01:08,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:01:08,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:01:08,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 15:01:08,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:01:08,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:01:08,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:01:08,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:01:08,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:01:08,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:01:08,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:01:08,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:01:08,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:01:08,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:01:08,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:01:08,479 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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2024-11-07 15:01:08,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:01:08,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:01:08,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:01:08,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:01:08,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:01:08,794 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-1.i [2024-11-07 15:01:10,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:01:10,434 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:01:10,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-11-07 15:01:10,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6977deb99/e9d9122f15a54da49128caa080ebcb3d/FLAGbf2369501 [2024-11-07 15:01:10,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6977deb99/e9d9122f15a54da49128caa080ebcb3d [2024-11-07 15:01:10,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:01:10,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:01:10,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:01:10,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:01:10,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:01:10,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:01:10" (1/1) ... [2024-11-07 15:01:10,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1acfff4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10, skipping insertion in model container [2024-11-07 15:01:10,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:01:10" (1/1) ... [2024-11-07 15:01:10,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:01:11,032 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-1.i[44118,44131] [2024-11-07 15:01:11,047 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-1.i[44660,44673] [2024-11-07 15:01:11,162 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-1.i[56247,56260] [2024-11-07 15:01:11,167 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-1.i[56368,56381] [2024-11-07 15:01:11,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:01:11,190 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:01:11,238 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-1.i[44118,44131] [2024-11-07 15:01:11,241 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-1.i[44660,44673] [2024-11-07 15:01:11,308 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-1.i[56247,56260] [2024-11-07 15:01:11,308 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-1.i[56368,56381] [2024-11-07 15:01:11,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:01:11,386 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:01:11,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:11 WrapperNode [2024-11-07 15:01:11,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:01:11,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:01:11,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:01:11,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:01:11,398 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:11" (1/1) ... [2024-11-07 15:01:11,430 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:11" (1/1) ... [2024-11-07 15:01:11,500 INFO L138 Inliner]: procedures = 282, calls = 296, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1477 [2024-11-07 15:01:11,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:01:11,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:01:11,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:01:11,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:01:11,510 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:11" (1/1) ... [2024-11-07 15:01:11,511 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:11" (1/1) ... [2024-11-07 15:01:11,530 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:11" (1/1) ... [2024-11-07 15:01:11,614 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 220, 34]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 49, 4]. [2024-11-07 15:01:11,614 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:11" (1/1) ... [2024-11-07 15:01:11,614 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:11" (1/1) ... [2024-11-07 15:01:11,642 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:11" (1/1) ... [2024-11-07 15:01:11,679 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:11" (1/1) ... [2024-11-07 15:01:11,688 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:11" (1/1) ... [2024-11-07 15:01:11,700 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:11" (1/1) ... [2024-11-07 15:01:11,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:01:11,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:01:11,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:01:11,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:01:11,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:11" (1/1) ... [2024-11-07 15:01:11,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:01:11,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:01:11,753 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:11,760 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:11,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 15:01:11,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 15:01:11,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 15:01:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 15:01:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 15:01:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 15:01:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-07 15:01:11,781 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-07 15:01:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 15:01:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 15:01:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 15:01:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 15:01:11,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 15:01:11,782 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 15:01:11,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 15:01:11,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 15:01:11,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 15:01:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 15:01:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:01:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:01:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-07 15:01:11,783 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-07 15:01:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 15:01:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 15:01:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 15:01:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 15:01:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-07 15:01:11,784 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-07 15:01:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 15:01:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 15:01:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 15:01:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 15:01:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:01:11,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:01:12,034 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:01:12,035 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:01:13,606 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2024-11-07 15:01:13,606 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:01:13,633 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:01:13,633 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-07 15:01:13,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:01:13 BoogieIcfgContainer [2024-11-07 15:01:13,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:01:13,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:01:13,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:01:13,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:01:13,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:01:10" (1/3) ... [2024-11-07 15:01:13,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74783080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:01:13, skipping insertion in model container [2024-11-07 15:01:13,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:11" (2/3) ... [2024-11-07 15:01:13,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74783080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:01:13, skipping insertion in model container [2024-11-07 15:01:13,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:01:13" (3/3) ... [2024-11-07 15:01:13,644 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-1.i [2024-11-07 15:01:13,658 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:01:13,658 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 15:01:13,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:01:13,728 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;@684e0483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:01:13,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 15:01:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 435 states, 413 states have (on average 1.5980629539951574) internal successors, (660), 417 states have internal predecessors, (660), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 15:01:13,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 15:01:13,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:13,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:01:13,742 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:13,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:13,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1705359720, now seen corresponding path program 1 times [2024-11-07 15:01:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:13,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488398230] [2024-11-07 15:01:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:13,926 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:13,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:13,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488398230] [2024-11-07 15:01:13,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488398230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:13,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:13,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:01:13,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367657449] [2024-11-07 15:01:13,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:13,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:01:13,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:13,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:01:13,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:01:13,957 INFO L87 Difference]: Start difference. First operand has 435 states, 413 states have (on average 1.5980629539951574) internal successors, (660), 417 states have internal predecessors, (660), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:14,040 INFO L93 Difference]: Finished difference Result 865 states and 1380 transitions. [2024-11-07 15:01:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:01:14,042 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:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:14,052 INFO L225 Difference]: With dead ends: 865 [2024-11-07 15:01:14,053 INFO L226 Difference]: Without dead ends: 428 [2024-11-07 15:01:14,057 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:14,060 INFO L432 NwaCegarLoop]: 613 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, 613 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:14,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 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:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-07 15:01:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2024-11-07 15:01:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 407 states have (on average 1.434889434889435) internal successors, (584), 412 states have internal predecessors, (584), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 609 transitions. [2024-11-07 15:01:14,128 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 609 transitions. Word has length 8 [2024-11-07 15:01:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:14,130 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 609 transitions. [2024-11-07 15:01:14,130 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:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 609 transitions. [2024-11-07 15:01:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 15:01:14,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:14,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:01:14,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:01:14,132 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:14,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:14,133 INFO L85 PathProgramCache]: Analyzing trace with hash -68909494, now seen corresponding path program 1 times [2024-11-07 15:01:14,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:14,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535257907] [2024-11-07 15:01:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:14,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:14,376 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:14,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:14,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535257907] [2024-11-07 15:01:14,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535257907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:01:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260381824] [2024-11-07 15:01:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:14,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:01:14,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:01:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:01:14,380 INFO L87 Difference]: Start difference. First operand 428 states and 609 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:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:14,586 INFO L93 Difference]: Finished difference Result 1041 states and 1492 transitions. [2024-11-07 15:01:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 15:01:14,588 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:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:14,593 INFO L225 Difference]: With dead ends: 1041 [2024-11-07 15:01:14,593 INFO L226 Difference]: Without dead ends: 829 [2024-11-07 15:01:14,595 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:14,596 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 557 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:14,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1841 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 15:01:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-07 15:01:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 430. [2024-11-07 15:01:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.4327628361858191) internal successors, (586), 414 states have internal predecessors, (586), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 611 transitions. [2024-11-07 15:01:14,636 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 611 transitions. Word has length 10 [2024-11-07 15:01:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:14,636 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 611 transitions. [2024-11-07 15:01:14,636 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:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 611 transitions. [2024-11-07 15:01:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 15:01:14,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:14,641 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:14,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:01:14,642 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:14,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:14,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1469408361, now seen corresponding path program 1 times [2024-11-07 15:01:14,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:14,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182653430] [2024-11-07 15:01:14,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:14,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:15,013 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:15,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:15,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182653430] [2024-11-07 15:01:15,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182653430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:15,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:15,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:01:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150424662] [2024-11-07 15:01:15,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:15,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:01:15,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:15,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:01:15,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:01:15,017 INFO L87 Difference]: Start difference. First operand 430 states and 611 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:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:15,126 INFO L93 Difference]: Finished difference Result 814 states and 1152 transitions. [2024-11-07 15:01:15,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:01:15,126 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:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:15,130 INFO L225 Difference]: With dead ends: 814 [2024-11-07 15:01:15,131 INFO L226 Difference]: Without dead ends: 388 [2024-11-07 15:01:15,132 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:15,133 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 36 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1498 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:15,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1498 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:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-07 15:01:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-11-07 15:01:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 367 states have (on average 1.3869209809264305) internal successors, (509), 372 states have internal predecessors, (509), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 534 transitions. [2024-11-07 15:01:15,154 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 534 transitions. Word has length 66 [2024-11-07 15:01:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:15,154 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 534 transitions. [2024-11-07 15:01:15,154 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:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 534 transitions. [2024-11-07 15:01:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 15:01:15,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:15,156 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:15,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:01:15,156 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:15,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1801171157, now seen corresponding path program 1 times [2024-11-07 15:01:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:15,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437926871] [2024-11-07 15:01:15,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:15,325 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:15,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:15,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437926871] [2024-11-07 15:01:15,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437926871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:15,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:15,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:01:15,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080230918] [2024-11-07 15:01:15,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:15,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:01:15,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:15,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:01:15,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:01:15,327 INFO L87 Difference]: Start difference. First operand 388 states and 534 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:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:15,408 INFO L93 Difference]: Finished difference Result 766 states and 1058 transitions. [2024-11-07 15:01:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:01:15,408 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:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:15,411 INFO L225 Difference]: With dead ends: 766 [2024-11-07 15:01:15,412 INFO L226 Difference]: Without dead ends: 382 [2024-11-07 15:01:15,413 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:15,414 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 9 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1499 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:15,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1499 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 15:01:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-07 15:01:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2024-11-07 15:01:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 361 states have (on average 1.3822714681440442) internal successors, (499), 366 states have internal predecessors, (499), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 524 transitions. [2024-11-07 15:01:15,431 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 524 transitions. Word has length 66 [2024-11-07 15:01:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:15,431 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 524 transitions. [2024-11-07 15:01:15,431 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:15,432 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 524 transitions. [2024-11-07 15:01:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 15:01:15,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:15,436 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:15,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:01:15,437 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:15,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:15,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1749246755, now seen corresponding path program 1 times [2024-11-07 15:01:15,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:15,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832242177] [2024-11-07 15:01:15,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:15,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:15,953 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:15,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832242177] [2024-11-07 15:01:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832242177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:15,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:15,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 15:01:15,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978622982] [2024-11-07 15:01:15,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:15,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:01:15,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:15,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:01:15,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:01:15,957 INFO L87 Difference]: Start difference. First operand 382 states and 524 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:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:16,344 INFO L93 Difference]: Finished difference Result 765 states and 1052 transitions. [2024-11-07 15:01:16,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:01:16,345 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:16,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:16,347 INFO L225 Difference]: With dead ends: 765 [2024-11-07 15:01:16,348 INFO L226 Difference]: Without dead ends: 387 [2024-11-07 15:01:16,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:01:16,350 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 10 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2242 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:16,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2242 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:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-07 15:01:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 384. [2024-11-07 15:01:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 363 states have (on average 1.3801652892561984) internal successors, (501), 368 states have internal predecessors, (501), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 526 transitions. [2024-11-07 15:01:16,377 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 526 transitions. Word has length 66 [2024-11-07 15:01:16,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:16,377 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 526 transitions. [2024-11-07 15:01:16,377 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:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 526 transitions. [2024-11-07 15:01:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 15:01:16,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:16,379 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:16,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:01:16,379 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:16,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1465973530, now seen corresponding path program 1 times [2024-11-07 15:01:16,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:16,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442925971] [2024-11-07 15:01:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:16,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:16,740 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,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:16,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442925971] [2024-11-07 15:01:16,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442925971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:16,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:16,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:01:16,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432053337] [2024-11-07 15:01:16,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:16,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:01:16,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:16,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:01:16,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:01:16,742 INFO L87 Difference]: Start difference. First operand 384 states and 526 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:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:16,873 INFO L93 Difference]: Finished difference Result 764 states and 1048 transitions. [2024-11-07 15:01:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 15:01:16,874 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:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:16,876 INFO L225 Difference]: With dead ends: 764 [2024-11-07 15:01:16,876 INFO L226 Difference]: Without dead ends: 384 [2024-11-07 15:01:16,877 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:16,878 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 13 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1411 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:16,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1411 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:16,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-07 15:01:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-07 15:01:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 363 states have (on average 1.3774104683195592) internal successors, (500), 368 states have internal predecessors, (500), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 525 transitions. [2024-11-07 15:01:16,895 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 525 transitions. Word has length 67 [2024-11-07 15:01:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:16,895 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 525 transitions. [2024-11-07 15:01:16,895 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:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 525 transitions. [2024-11-07 15:01:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 15:01:16,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:16,896 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:16,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:01:16,896 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:16,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:16,897 INFO L85 PathProgramCache]: Analyzing trace with hash -368632186, now seen corresponding path program 1 times [2024-11-07 15:01:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:16,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407050701] [2024-11-07 15:01:16,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:16,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:17,202 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,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:17,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407050701] [2024-11-07 15:01:17,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407050701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:17,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:17,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:01:17,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881470220] [2024-11-07 15:01:17,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:17,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:01:17,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:17,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:01:17,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:01:17,208 INFO L87 Difference]: Start difference. First operand 384 states and 525 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:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:17,567 INFO L93 Difference]: Finished difference Result 769 states and 1054 transitions. [2024-11-07 15:01:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:01:17,568 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:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:17,572 INFO L225 Difference]: With dead ends: 769 [2024-11-07 15:01:17,572 INFO L226 Difference]: Without dead ends: 389 [2024-11-07 15:01:17,573 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:17,574 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 10 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2690 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:17,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2690 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:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-07 15:01:17,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 388. [2024-11-07 15:01:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 367 states have (on average 1.3760217983651226) internal successors, (505), 372 states have internal predecessors, (505), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 530 transitions. [2024-11-07 15:01:17,589 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 530 transitions. Word has length 67 [2024-11-07 15:01:17,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:17,590 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 530 transitions. [2024-11-07 15:01:17,590 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:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 530 transitions. [2024-11-07 15:01:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 15:01:17,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:17,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:01:17,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:01:17,592 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:17,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash -187413054, now seen corresponding path program 1 times [2024-11-07 15:01:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:17,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034981092] [2024-11-07 15:01:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:17,893 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,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:17,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034981092] [2024-11-07 15:01:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034981092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:17,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:17,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 15:01:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907739427] [2024-11-07 15:01:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:17,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:01:17,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:17,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:01:17,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:01:17,895 INFO L87 Difference]: Start difference. First operand 388 states and 530 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:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:18,172 INFO L93 Difference]: Finished difference Result 775 states and 1061 transitions. [2024-11-07 15:01:18,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:01:18,173 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:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:18,175 INFO L225 Difference]: With dead ends: 775 [2024-11-07 15:01:18,176 INFO L226 Difference]: Without dead ends: 391 [2024-11-07 15:01:18,177 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:18,178 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 4 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:18,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2265 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:01:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-07 15:01:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-07 15:01:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 370 states have (on average 1.372972972972973) internal successors, (508), 375 states have internal predecessors, (508), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 533 transitions. [2024-11-07 15:01:18,192 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 533 transitions. Word has length 68 [2024-11-07 15:01:18,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:18,192 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 533 transitions. [2024-11-07 15:01:18,192 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:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 533 transitions. [2024-11-07 15:01:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 15:01:18,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:18,193 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:18,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:01:18,194 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:18,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1333583977, now seen corresponding path program 1 times [2024-11-07 15:01:18,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:18,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113545971] [2024-11-07 15:01:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:18,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:18,644 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,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:18,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113545971] [2024-11-07 15:01:18,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113545971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:18,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:18,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:01:18,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870179717] [2024-11-07 15:01:18,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:18,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:01:18,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:18,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:01:18,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:01:18,646 INFO L87 Difference]: Start difference. First operand 391 states and 533 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:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:19,159 INFO L93 Difference]: Finished difference Result 791 states and 1083 transitions. [2024-11-07 15:01:19,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 15:01:19,160 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:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:19,164 INFO L225 Difference]: With dead ends: 791 [2024-11-07 15:01:19,164 INFO L226 Difference]: Without dead ends: 404 [2024-11-07 15:01:19,165 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:19,166 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 30 mSDsluCounter, 3131 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3633 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:19,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3633 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:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-07 15:01:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2024-11-07 15:01:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 380 states have (on average 1.3736842105263158) internal successors, (522), 385 states have internal predecessors, (522), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 547 transitions. [2024-11-07 15:01:19,182 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 547 transitions. Word has length 68 [2024-11-07 15:01:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:19,182 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 547 transitions. [2024-11-07 15:01:19,182 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:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 547 transitions. [2024-11-07 15:01:19,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 15:01:19,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:19,183 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,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:01:19,183 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:19,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:19,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1348712318, now seen corresponding path program 1 times [2024-11-07 15:01:19,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:19,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660257410] [2024-11-07 15:01:19,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:19,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:19,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:19,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:19,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660257410] [2024-11-07 15:01:19,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660257410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:19,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:19,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:01:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115823350] [2024-11-07 15:01:19,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:19,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:01:19,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:19,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:01:19,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:01:19,634 INFO L87 Difference]: Start difference. First operand 401 states and 547 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:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:20,051 INFO L93 Difference]: Finished difference Result 801 states and 1095 transitions. [2024-11-07 15:01:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 15:01:20,054 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:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:20,057 INFO L225 Difference]: With dead ends: 801 [2024-11-07 15:01:20,057 INFO L226 Difference]: Without dead ends: 404 [2024-11-07 15:01:20,058 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:20,061 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 23 mSDsluCounter, 2676 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:20,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3182 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 15:01:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-07 15:01:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-07 15:01:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 383 states have (on average 1.370757180156658) internal successors, (525), 388 states have internal predecessors, (525), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 550 transitions. [2024-11-07 15:01:20,077 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 550 transitions. Word has length 68 [2024-11-07 15:01:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:20,077 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 550 transitions. [2024-11-07 15:01:20,077 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:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 550 transitions. [2024-11-07 15:01:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 15:01:20,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:20,078 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:20,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:01:20,078 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:20,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:20,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1149610205, now seen corresponding path program 1 times [2024-11-07 15:01:20,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:20,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777385929] [2024-11-07 15:01:20,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:20,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:20,352 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,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:20,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777385929] [2024-11-07 15:01:20,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777385929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:20,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:20,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:01:20,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341035419] [2024-11-07 15:01:20,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:20,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:01:20,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:20,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:01:20,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:01:20,355 INFO L87 Difference]: Start difference. First operand 404 states and 550 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:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:20,702 INFO L93 Difference]: Finished difference Result 809 states and 1104 transitions. [2024-11-07 15:01:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:01:20,703 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:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:20,705 INFO L225 Difference]: With dead ends: 809 [2024-11-07 15:01:20,706 INFO L226 Difference]: Without dead ends: 409 [2024-11-07 15:01:20,724 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:20,725 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 9 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2696 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:20,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2696 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:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-07 15:01:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 404. [2024-11-07 15:01:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 383 states have (on average 1.370757180156658) internal successors, (525), 388 states have internal predecessors, (525), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 550 transitions. [2024-11-07 15:01:20,738 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 550 transitions. Word has length 69 [2024-11-07 15:01:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:20,739 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 550 transitions. [2024-11-07 15:01:20,739 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:20,739 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 550 transitions. [2024-11-07 15:01:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 15:01:20,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:20,740 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:20,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:01:20,740 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:20,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash 412879753, now seen corresponding path program 1 times [2024-11-07 15:01:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:20,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776564637] [2024-11-07 15:01:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:01:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:21,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776564637] [2024-11-07 15:01:21,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776564637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:21,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:21,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:01:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816201949] [2024-11-07 15:01:21,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:21,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:01:21,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:21,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:01:21,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:01:21,322 INFO L87 Difference]: Start difference. First operand 404 states and 550 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:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:22,091 INFO L93 Difference]: Finished difference Result 1162 states and 1596 transitions. [2024-11-07 15:01:22,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:22,092 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:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:22,096 INFO L225 Difference]: With dead ends: 1162 [2024-11-07 15:01:22,096 INFO L226 Difference]: Without dead ends: 762 [2024-11-07 15:01:22,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-07 15:01:22,099 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 600 mSDsluCounter, 2168 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:22,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 2664 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 15:01:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-07 15:01:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 436. [2024-11-07 15:01:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 415 states have (on average 1.342168674698795) internal successors, (557), 420 states have internal predecessors, (557), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 582 transitions. [2024-11-07 15:01:22,118 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 582 transitions. Word has length 69 [2024-11-07 15:01:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:22,119 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 582 transitions. [2024-11-07 15:01:22,119 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:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 582 transitions. [2024-11-07 15:01:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 15:01:22,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:22,120 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:22,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:01:22,121 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:22,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:22,121 INFO L85 PathProgramCache]: Analyzing trace with hash -982782962, now seen corresponding path program 1 times [2024-11-07 15:01:22,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:22,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000001401] [2024-11-07 15:01:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:22,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:22,419 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,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:22,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000001401] [2024-11-07 15:01:22,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000001401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:22,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:22,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:01:22,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733464559] [2024-11-07 15:01:22,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:22,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:01:22,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:01:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:01:22,421 INFO L87 Difference]: Start difference. First operand 436 states and 582 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:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:22,714 INFO L93 Difference]: Finished difference Result 846 states and 1142 transitions. [2024-11-07 15:01:22,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 15:01:22,715 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:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:22,718 INFO L225 Difference]: With dead ends: 846 [2024-11-07 15:01:22,718 INFO L226 Difference]: Without dead ends: 446 [2024-11-07 15:01:22,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:01:22,719 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 16 mSDsluCounter, 2284 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2785 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:22,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2785 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:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-07 15:01:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 439. [2024-11-07 15:01:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 418 states have (on average 1.3421052631578947) internal successors, (561), 423 states have internal predecessors, (561), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 586 transitions. [2024-11-07 15:01:22,734 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 586 transitions. Word has length 70 [2024-11-07 15:01:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:22,735 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 586 transitions. [2024-11-07 15:01:22,735 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:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 586 transitions. [2024-11-07 15:01:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 15:01:22,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:22,736 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:22,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:01:22,736 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:22,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1154457842, now seen corresponding path program 1 times [2024-11-07 15:01:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:22,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375785883] [2024-11-07 15:01:22,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:22,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:23,043 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,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375785883] [2024-11-07 15:01:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375785883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:23,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:23,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:01:23,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128180351] [2024-11-07 15:01:23,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:23,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:01:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:23,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:01:23,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:01:23,045 INFO L87 Difference]: Start difference. First operand 439 states and 586 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:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:23,518 INFO L93 Difference]: Finished difference Result 852 states and 1150 transitions. [2024-11-07 15:01:23,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:23,519 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:23,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:23,521 INFO L225 Difference]: With dead ends: 852 [2024-11-07 15:01:23,522 INFO L226 Difference]: Without dead ends: 449 [2024-11-07 15:01:23,523 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:23,523 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 26 mSDsluCounter, 3063 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3569 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:23,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3569 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:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-07 15:01:23,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2024-11-07 15:01:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 418 states have (on average 1.3421052631578947) internal successors, (561), 423 states have internal predecessors, (561), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 586 transitions. [2024-11-07 15:01:23,542 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 586 transitions. Word has length 70 [2024-11-07 15:01:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:23,543 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 586 transitions. [2024-11-07 15:01:23,543 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:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 586 transitions. [2024-11-07 15:01:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:01:23,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:23,544 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:23,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:01:23,544 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:23,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash -630555315, now seen corresponding path program 1 times [2024-11-07 15:01:23,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:23,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637440978] [2024-11-07 15:01:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:23,874 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,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:23,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637440978] [2024-11-07 15:01:23,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637440978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:23,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:01:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255369311] [2024-11-07 15:01:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:23,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:01:23,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:23,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:01:23,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:01:23,876 INFO L87 Difference]: Start difference. First operand 439 states and 586 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:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:24,341 INFO L93 Difference]: Finished difference Result 858 states and 1159 transitions. [2024-11-07 15:01:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:24,342 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:24,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:24,345 INFO L225 Difference]: With dead ends: 858 [2024-11-07 15:01:24,345 INFO L226 Difference]: Without dead ends: 455 [2024-11-07 15:01:24,346 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:24,347 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 22 mSDsluCounter, 3116 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3624 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:24,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3624 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:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-07 15:01:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 449. [2024-11-07 15:01:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 428 states have (on average 1.338785046728972) internal successors, (573), 433 states have internal predecessors, (573), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 598 transitions. [2024-11-07 15:01:24,368 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 598 transitions. Word has length 71 [2024-11-07 15:01:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:24,369 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 598 transitions. [2024-11-07 15:01:24,369 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:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 598 transitions. [2024-11-07 15:01:24,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:01:24,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:24,369 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:24,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:01:24,370 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:24,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:24,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1199400169, now seen corresponding path program 1 times [2024-11-07 15:01:24,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:24,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986755308] [2024-11-07 15:01:24,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:24,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:24,676 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,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986755308] [2024-11-07 15:01:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986755308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:24,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:01:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698139598] [2024-11-07 15:01:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:24,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:01:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:24,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:01:24,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:01:24,679 INFO L87 Difference]: Start difference. First operand 449 states and 598 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:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:25,184 INFO L93 Difference]: Finished difference Result 878 states and 1183 transitions. [2024-11-07 15:01:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:25,184 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:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:25,187 INFO L225 Difference]: With dead ends: 878 [2024-11-07 15:01:25,187 INFO L226 Difference]: Without dead ends: 465 [2024-11-07 15:01:25,189 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:25,190 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 13 mSDsluCounter, 3552 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4046 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.5s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:25,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4046 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 15:01:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-07 15:01:25,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 452. [2024-11-07 15:01:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 431 states have (on average 1.3387470997679813) internal successors, (577), 436 states have internal predecessors, (577), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 602 transitions. [2024-11-07 15:01:25,213 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 602 transitions. Word has length 71 [2024-11-07 15:01:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:25,213 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 602 transitions. [2024-11-07 15:01:25,214 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:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 602 transitions. [2024-11-07 15:01:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:01:25,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:25,215 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:25,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:01:25,216 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:25,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash -298652567, now seen corresponding path program 1 times [2024-11-07 15:01:25,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:25,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926282795] [2024-11-07 15:01:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:25,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:25,496 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,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:25,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926282795] [2024-11-07 15:01:25,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926282795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:25,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:25,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:01:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566453002] [2024-11-07 15:01:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:25,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:01:25,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:25,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:01:25,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:01:25,499 INFO L87 Difference]: Start difference. First operand 452 states and 602 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:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:25,798 INFO L93 Difference]: Finished difference Result 873 states and 1173 transitions. [2024-11-07 15:01:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:01:25,799 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:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:25,802 INFO L225 Difference]: With dead ends: 873 [2024-11-07 15:01:25,802 INFO L226 Difference]: Without dead ends: 457 [2024-11-07 15:01:25,803 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:25,803 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 7 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:25,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2720 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 15:01:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-07 15:01:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 452. [2024-11-07 15:01:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 431 states have (on average 1.3364269141531322) internal successors, (576), 436 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 601 transitions. [2024-11-07 15:01:25,819 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 601 transitions. Word has length 71 [2024-11-07 15:01:25,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:25,819 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 601 transitions. [2024-11-07 15:01:25,820 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:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 601 transitions. [2024-11-07 15:01:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:01:25,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:25,821 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:25,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:01:25,821 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:25,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:25,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1314018434, now seen corresponding path program 1 times [2024-11-07 15:01:25,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:25,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551342595] [2024-11-07 15:01:25,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:25,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:26,070 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,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:26,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551342595] [2024-11-07 15:01:26,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551342595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:26,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:26,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:01:26,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135091379] [2024-11-07 15:01:26,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:26,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:01:26,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:26,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:01:26,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:01:26,073 INFO L87 Difference]: Start difference. First operand 452 states and 601 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:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:26,602 INFO L93 Difference]: Finished difference Result 871 states and 1171 transitions. [2024-11-07 15:01:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:01:26,603 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:26,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:26,608 INFO L225 Difference]: With dead ends: 871 [2024-11-07 15:01:26,608 INFO L226 Difference]: Without dead ends: 455 [2024-11-07 15:01:26,609 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:26,610 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 4 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2679 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.5s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:26,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2679 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 15:01:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-07 15:01:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2024-11-07 15:01:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 434 states have (on average 1.3341013824884793) internal successors, (579), 439 states have internal predecessors, (579), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 604 transitions. [2024-11-07 15:01:26,629 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 604 transitions. Word has length 71 [2024-11-07 15:01:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:26,629 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 604 transitions. [2024-11-07 15:01:26,629 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:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 604 transitions. [2024-11-07 15:01:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:01:26,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:26,631 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:26,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:01:26,634 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:26,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1396403887, now seen corresponding path program 1 times [2024-11-07 15:01:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:26,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836105061] [2024-11-07 15:01:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:26,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:27,068 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,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:27,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836105061] [2024-11-07 15:01:27,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836105061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:27,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:27,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:01:27,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638706789] [2024-11-07 15:01:27,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:27,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:01:27,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:27,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:01:27,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:01:27,069 INFO L87 Difference]: Start difference. First operand 455 states and 604 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:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:27,549 INFO L93 Difference]: Finished difference Result 886 states and 1190 transitions. [2024-11-07 15:01:27,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:27,550 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:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:27,553 INFO L225 Difference]: With dead ends: 886 [2024-11-07 15:01:27,553 INFO L226 Difference]: Without dead ends: 467 [2024-11-07 15:01:27,555 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:27,555 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 9 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3610 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:27,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3610 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 15:01:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-07 15:01:27,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 459. [2024-11-07 15:01:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 438 states have (on average 1.3333333333333333) internal successors, (584), 443 states have internal predecessors, (584), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 609 transitions. [2024-11-07 15:01:27,572 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 609 transitions. Word has length 72 [2024-11-07 15:01:27,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:27,572 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 609 transitions. [2024-11-07 15:01:27,572 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:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 609 transitions. [2024-11-07 15:01:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:01:27,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:27,574 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:27,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 15:01:27,574 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:27,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash 532169790, now seen corresponding path program 1 times [2024-11-07 15:01:27,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:27,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449669382] [2024-11-07 15:01:27,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:27,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:27,891 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,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:27,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449669382] [2024-11-07 15:01:27,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449669382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:27,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:27,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 15:01:27,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93586278] [2024-11-07 15:01:27,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:27,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:01:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:27,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:01:27,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:01:27,893 INFO L87 Difference]: Start difference. First operand 459 states and 609 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:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:28,382 INFO L93 Difference]: Finished difference Result 895 states and 1200 transitions. [2024-11-07 15:01:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:28,383 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:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:28,386 INFO L225 Difference]: With dead ends: 895 [2024-11-07 15:01:28,386 INFO L226 Difference]: Without dead ends: 472 [2024-11-07 15:01:28,387 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:28,388 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 36 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4076 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:28,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4076 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 15:01:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-07 15:01:28,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 462. [2024-11-07 15:01:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 441 states have (on average 1.3310657596371882) internal successors, (587), 446 states have internal predecessors, (587), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 612 transitions. [2024-11-07 15:01:28,404 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 612 transitions. Word has length 72 [2024-11-07 15:01:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:28,404 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 612 transitions. [2024-11-07 15:01:28,404 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:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 612 transitions. [2024-11-07 15:01:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:01:28,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:28,405 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:28,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 15:01:28,405 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:28,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:28,406 INFO L85 PathProgramCache]: Analyzing trace with hash -502358731, now seen corresponding path program 1 times [2024-11-07 15:01:28,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:28,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012105834] [2024-11-07 15:01:28,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:28,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:28,878 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,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:28,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012105834] [2024-11-07 15:01:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012105834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:28,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:28,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:01:28,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102564384] [2024-11-07 15:01:28,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:28,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:01:28,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:28,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:01:28,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:01:28,879 INFO L87 Difference]: Start difference. First operand 462 states and 612 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:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:29,970 INFO L93 Difference]: Finished difference Result 894 states and 1196 transitions. [2024-11-07 15:01:29,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:29,971 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:29,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:29,974 INFO L225 Difference]: With dead ends: 894 [2024-11-07 15:01:29,974 INFO L226 Difference]: Without dead ends: 468 [2024-11-07 15:01:29,976 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:29,976 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 33 mSDsluCounter, 3040 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3539 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.9s IncrementalHoareTripleChecker+Time [2024-11-07 15:01:29,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3539 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 15:01:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-07 15:01:29,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 463. [2024-11-07 15:01:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 442 states have (on average 1.330316742081448) internal successors, (588), 447 states have internal predecessors, (588), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 613 transitions. [2024-11-07 15:01:29,992 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 613 transitions. Word has length 72 [2024-11-07 15:01:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:29,993 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 613 transitions. [2024-11-07 15:01:29,993 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:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 613 transitions. [2024-11-07 15:01:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:01:29,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:29,994 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,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 15:01:29,994 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:29,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1956145645, now seen corresponding path program 1 times [2024-11-07 15:01:29,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:29,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506788660] [2024-11-07 15:01:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:29,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:30,260 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,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:30,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506788660] [2024-11-07 15:01:30,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506788660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:30,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:30,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:01:30,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559614323] [2024-11-07 15:01:30,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:30,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:01:30,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:30,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:01:30,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:01:30,263 INFO L87 Difference]: Start difference. First operand 463 states and 613 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:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:01:30,765 INFO L93 Difference]: Finished difference Result 899 states and 1203 transitions. [2024-11-07 15:01:30,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:01:30,766 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:30,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:01:30,770 INFO L225 Difference]: With dead ends: 899 [2024-11-07 15:01:30,770 INFO L226 Difference]: Without dead ends: 472 [2024-11-07 15:01:30,771 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:30,773 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 22 mSDsluCounter, 3063 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3569 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:30,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3569 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:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-07 15:01:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 460. [2024-11-07 15:01:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 439 states have (on average 1.3325740318906605) internal successors, (585), 444 states have internal predecessors, (585), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:01:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 610 transitions. [2024-11-07 15:01:30,796 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 610 transitions. Word has length 72 [2024-11-07 15:01:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:01:30,796 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 610 transitions. [2024-11-07 15:01:30,796 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:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 610 transitions. [2024-11-07 15:01:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:01:30,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:01:30,797 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,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 15:01:30,797 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:30,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:01:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1353154441, now seen corresponding path program 1 times [2024-11-07 15:01:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:01:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362536095] [2024-11-07 15:01:30,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:01:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:01:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:01:43,254 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 15:01:54,322 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:01:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:01:54,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:01:54,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362536095] [2024-11-07 15:01:54,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362536095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:01:54,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:01:54,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 15:01:54,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525252683] [2024-11-07 15:01:54,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:01:54,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:01:54,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:01:54,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:01:54,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-11-07 15:01:54,391 INFO L87 Difference]: Start difference. First operand 460 states and 610 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:56,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:02:00,517 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:04,520 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,525 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:12,531 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:16,536 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:20,543 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:24,549 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:28,558 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:33,405 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:36,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:02:40,288 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 []