./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.06.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/systemc/transmitter.06.cil.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'bbfdf3f22061e77485b28b33d06a9820d2c4b7aa22afc378a1743c2d746b69df'] 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/systemc/transmitter.06.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bbfdf3f22061e77485b28b33d06a9820d2c4b7aa22afc378a1743c2d746b69df --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:59:39,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:59:39,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:59:39,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:59:39,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:59:39,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:59:39,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:59:39,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:59:39,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:59:39,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:59:39,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:59:39,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:59:39,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:59:39,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:59:39,852 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:59:39,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:59:39,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:59:39,852 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:59:39,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:59:39,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:59:39,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:59:39,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:59:39,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:59:39,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:59:39,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:59:39,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:59:39,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:59:39,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:59:39,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:59:39,855 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 -> bbfdf3f22061e77485b28b33d06a9820d2c4b7aa22afc378a1743c2d746b69df [2024-11-06 23:59:40,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:59:40,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:59:40,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:59:40,120 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:59:40,120 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:59:40,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.06.cil.c [2024-11-06 23:59:41,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:59:41,524 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:59:41,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c [2024-11-06 23:59:41,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80b3141f3/32a7f659db5f4789aead5628bcb7221f/FLAGab086dcd0 [2024-11-06 23:59:41,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80b3141f3/32a7f659db5f4789aead5628bcb7221f [2024-11-06 23:59:41,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:59:41,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:59:41,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:59:41,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:59:41,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:59:41,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6100ae7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41, skipping insertion in model container [2024-11-06 23:59:41,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:59:41,719 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/systemc/transmitter.06.cil.c[706,719] [2024-11-06 23:59:41,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:59:41,795 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:59:41,804 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/systemc/transmitter.06.cil.c[706,719] [2024-11-06 23:59:41,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:59:41,860 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:59:41,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41 WrapperNode [2024-11-06 23:59:41,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:59:41,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:59:41,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:59:41,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:59:41,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,903 INFO L138 Inliner]: procedures = 40, calls = 48, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 505 [2024-11-06 23:59:41,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:59:41,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:59:41,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:59:41,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:59:41,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,931 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 23:59:41,932 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:59:41,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:59:41,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:59:41,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:59:41,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (1/1) ... [2024-11-06 23:59:41,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:59:41,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:59:41,990 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-06 23:59:41,994 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-06 23:59:42,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:59:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-06 23:59:42,016 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-06 23:59:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-06 23:59:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-06 23:59:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-06 23:59:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-06 23:59:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-06 23:59:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-06 23:59:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-06 23:59:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-06 23:59:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:59:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-06 23:59:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-06 23:59:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:59:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:59:42,128 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:59:42,130 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:59:42,733 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-06 23:59:42,733 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:59:42,745 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:59:42,746 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-06 23:59:42,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:59:42 BoogieIcfgContainer [2024-11-06 23:59:42,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:59:42,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:59:42,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:59:42,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:59:42,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:59:41" (1/3) ... [2024-11-06 23:59:42,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cf7bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:59:42, skipping insertion in model container [2024-11-06 23:59:42,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:41" (2/3) ... [2024-11-06 23:59:42,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cf7bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:59:42, skipping insertion in model container [2024-11-06 23:59:42,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:59:42" (3/3) ... [2024-11-06 23:59:42,754 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.06.cil.c [2024-11-06 23:59:42,766 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:59:42,767 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:59:42,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:59:42,834 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;@5767dc2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:59:42,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:59:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 208 states have (on average 1.6105769230769231) internal successors, (335), 210 states have internal predecessors, (335), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-06 23:59:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-06 23:59:42,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:42,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:42,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:42,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash 510149544, now seen corresponding path program 1 times [2024-11-06 23:59:42,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:42,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95939035] [2024-11-06 23:59:42,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:42,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:59:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:59:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:59:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,400 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-06 23:59:43,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:43,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95939035] [2024-11-06 23:59:43,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95939035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:43,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:43,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:59:43,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732751351] [2024-11-06 23:59:43,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:43,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:59:43,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:43,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:59:43,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:59:43,430 INFO L87 Difference]: Start difference. First operand has 235 states, 208 states have (on average 1.6105769230769231) internal successors, (335), 210 states have internal predecessors, (335), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:44,525 INFO L93 Difference]: Finished difference Result 535 states and 859 transitions. [2024-11-06 23:59:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:59:44,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-06 23:59:44,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:44,536 INFO L225 Difference]: With dead ends: 535 [2024-11-06 23:59:44,536 INFO L226 Difference]: Without dead ends: 304 [2024-11-06 23:59:44,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:59:44,544 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 579 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:44,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 469 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 23:59:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-06 23:59:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 230. [2024-11-06 23:59:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 204 states have (on average 1.5098039215686274) internal successors, (308), 205 states have internal predecessors, (308), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-06 23:59:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 346 transitions. [2024-11-06 23:59:44,600 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 346 transitions. Word has length 115 [2024-11-06 23:59:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:44,600 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 346 transitions. [2024-11-06 23:59:44,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 346 transitions. [2024-11-06 23:59:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-06 23:59:44,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:44,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:44,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:59:44,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:44,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1133431146, now seen corresponding path program 1 times [2024-11-06 23:59:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220799848] [2024-11-06 23:59:44,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:44,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:59:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:44,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:44,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:59:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:44,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:59:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:44,938 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-06 23:59:44,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220799848] [2024-11-06 23:59:44,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220799848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:44,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:44,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:59:44,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977388792] [2024-11-06 23:59:44,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:44,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:59:44,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:44,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:59:44,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:59:44,944 INFO L87 Difference]: Start difference. First operand 230 states and 346 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:46,478 INFO L93 Difference]: Finished difference Result 815 states and 1266 transitions. [2024-11-06 23:59:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 23:59:46,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-06 23:59:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:46,489 INFO L225 Difference]: With dead ends: 815 [2024-11-06 23:59:46,490 INFO L226 Difference]: Without dead ends: 599 [2024-11-06 23:59:46,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:59:46,493 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 852 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:46,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 857 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:59:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-06 23:59:46,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 451. [2024-11-06 23:59:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 404 states have (on average 1.5198019801980198) internal successors, (614), 406 states have internal predecessors, (614), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2024-11-06 23:59:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 683 transitions. [2024-11-06 23:59:46,565 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 683 transitions. Word has length 115 [2024-11-06 23:59:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:46,566 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 683 transitions. [2024-11-06 23:59:46,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 683 transitions. [2024-11-06 23:59:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-06 23:59:46,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:46,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:46,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 23:59:46,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:46,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash -849715959, now seen corresponding path program 1 times [2024-11-06 23:59:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:46,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415800190] [2024-11-06 23:59:46,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:46,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:59:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:59:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:59:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:46,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:46,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415800190] [2024-11-06 23:59:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415800190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:46,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:46,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:46,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580069649] [2024-11-06 23:59:46,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:46,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:46,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:46,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:46,893 INFO L87 Difference]: Start difference. First operand 451 states and 683 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:47,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:47,830 INFO L93 Difference]: Finished difference Result 1044 states and 1610 transitions. [2024-11-06 23:59:47,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:59:47,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-06 23:59:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:47,835 INFO L225 Difference]: With dead ends: 1044 [2024-11-06 23:59:47,835 INFO L226 Difference]: Without dead ends: 607 [2024-11-06 23:59:47,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:59:47,838 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 721 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:47,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 625 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 23:59:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-06 23:59:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 451. [2024-11-06 23:59:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 404 states have (on average 1.5148514851485149) internal successors, (612), 406 states have internal predecessors, (612), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2024-11-06 23:59:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 681 transitions. [2024-11-06 23:59:47,899 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 681 transitions. Word has length 115 [2024-11-06 23:59:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:47,901 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 681 transitions. [2024-11-06 23:59:47,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 681 transitions. [2024-11-06 23:59:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-06 23:59:47,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:47,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:47,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 23:59:47,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:47,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:47,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1538848071, now seen corresponding path program 1 times [2024-11-06 23:59:47,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:47,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577264146] [2024-11-06 23:59:47,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:47,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:47,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:59:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:59:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:59:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,101 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-06 23:59:48,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:48,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577264146] [2024-11-06 23:59:48,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577264146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:48,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:48,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:48,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296046039] [2024-11-06 23:59:48,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:48,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:48,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:48,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:48,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:48,103 INFO L87 Difference]: Start difference. First operand 451 states and 681 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:50,316 INFO L93 Difference]: Finished difference Result 1428 states and 2189 transitions. [2024-11-06 23:59:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:59:50,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-06 23:59:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:50,324 INFO L225 Difference]: With dead ends: 1428 [2024-11-06 23:59:50,325 INFO L226 Difference]: Without dead ends: 991 [2024-11-06 23:59:50,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:59:50,328 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 924 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 2477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:50,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1508 Invalid, 2477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 23:59:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-06 23:59:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 658. [2024-11-06 23:59:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 590 states have (on average 1.506779661016949) internal successors, (889), 593 states have internal predecessors, (889), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-11-06 23:59:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 988 transitions. [2024-11-06 23:59:50,385 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 988 transitions. Word has length 115 [2024-11-06 23:59:50,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:50,385 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 988 transitions. [2024-11-06 23:59:50,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 988 transitions. [2024-11-06 23:59:50,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-06 23:59:50,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:50,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:50,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 23:59:50,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:50,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:50,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1155048119, now seen corresponding path program 1 times [2024-11-06 23:59:50,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:50,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526860864] [2024-11-06 23:59:50,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:50,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:50,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:59:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:50,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:50,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:59:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:50,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:59:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:50,579 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-06 23:59:50,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:50,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526860864] [2024-11-06 23:59:50,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526860864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:50,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:50,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:50,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383507058] [2024-11-06 23:59:50,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:50,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:50,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:50,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:50,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:50,582 INFO L87 Difference]: Start difference. First operand 658 states and 988 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:52,604 INFO L93 Difference]: Finished difference Result 2194 states and 3354 transitions. [2024-11-06 23:59:52,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:59:52,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-06 23:59:52,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:52,612 INFO L225 Difference]: With dead ends: 2194 [2024-11-06 23:59:52,612 INFO L226 Difference]: Without dead ends: 1550 [2024-11-06 23:59:52,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:59:52,615 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 918 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 2450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:52,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 1506 Invalid, 2450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 23:59:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2024-11-06 23:59:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1077. [2024-11-06 23:59:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 967 states have (on average 1.501551189245088) internal successors, (1452), 972 states have internal predecessors, (1452), 75 states have call successors, (75), 30 states have call predecessors, (75), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-11-06 23:59:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1615 transitions. [2024-11-06 23:59:52,698 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1615 transitions. Word has length 115 [2024-11-06 23:59:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:52,698 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1615 transitions. [2024-11-06 23:59:52,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1615 transitions. [2024-11-06 23:59:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-06 23:59:52,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:52,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:52,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 23:59:52,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:52,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:52,703 INFO L85 PathProgramCache]: Analyzing trace with hash 196337099, now seen corresponding path program 1 times [2024-11-06 23:59:52,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:52,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148988783] [2024-11-06 23:59:52,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:52,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:52,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:52,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:59:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:52,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:59:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:52,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:59:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:52,879 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-06 23:59:52,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:52,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148988783] [2024-11-06 23:59:52,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148988783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:52,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:52,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665209876] [2024-11-06 23:59:52,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:52,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:52,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:52,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:52,881 INFO L87 Difference]: Start difference. First operand 1077 states and 1615 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:54,696 INFO L93 Difference]: Finished difference Result 3685 states and 5613 transitions. [2024-11-06 23:59:54,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:59:54,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-06 23:59:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:54,710 INFO L225 Difference]: With dead ends: 3685 [2024-11-06 23:59:54,710 INFO L226 Difference]: Without dead ends: 2622 [2024-11-06 23:59:54,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:59:54,714 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 917 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 2437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:54,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1506 Invalid, 2437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 23:59:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2024-11-06 23:59:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 1916. [2024-11-06 23:59:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1722 states have (on average 1.4970963995354238) internal successors, (2578), 1731 states have internal predecessors, (2578), 131 states have call successors, (131), 54 states have call predecessors, (131), 62 states have return successors, (166), 138 states have call predecessors, (166), 131 states have call successors, (166) [2024-11-06 23:59:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2875 transitions. [2024-11-06 23:59:54,835 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2875 transitions. Word has length 115 [2024-11-06 23:59:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:54,835 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2875 transitions. [2024-11-06 23:59:54,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2875 transitions. [2024-11-06 23:59:54,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-06 23:59:54,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:54,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:54,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 23:59:54,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:54,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:54,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1422637815, now seen corresponding path program 1 times [2024-11-06 23:59:54,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:54,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873073483] [2024-11-06 23:59:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:59:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:55,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:59:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:59:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:55,018 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-06 23:59:55,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:55,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873073483] [2024-11-06 23:59:55,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873073483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:55,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:55,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:55,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155292693] [2024-11-06 23:59:55,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:55,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:55,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:55,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:55,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:55,020 INFO L87 Difference]: Start difference. First operand 1916 states and 2875 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:56,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:56,960 INFO L93 Difference]: Finished difference Result 6666 states and 10147 transitions. [2024-11-06 23:59:56,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:59:56,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-06 23:59:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:56,984 INFO L225 Difference]: With dead ends: 6666 [2024-11-06 23:59:56,984 INFO L226 Difference]: Without dead ends: 4764 [2024-11-06 23:59:56,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:59:56,993 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 916 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:56,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1506 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 23:59:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2024-11-06 23:59:57,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 3601. [2024-11-06 23:59:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3601 states, 3239 states have (on average 1.494288360605125) internal successors, (4840), 3256 states have internal predecessors, (4840), 243 states have call successors, (243), 102 states have call predecessors, (243), 118 states have return successors, (340), 258 states have call predecessors, (340), 243 states have call successors, (340) [2024-11-06 23:59:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 5423 transitions. [2024-11-06 23:59:57,221 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 5423 transitions. Word has length 115 [2024-11-06 23:59:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:57,223 INFO L471 AbstractCegarLoop]: Abstraction has 3601 states and 5423 transitions. [2024-11-06 23:59:57,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 5423 transitions. [2024-11-06 23:59:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-06 23:59:57,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:57,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:57,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 23:59:57,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:57,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:57,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1988820491, now seen corresponding path program 1 times [2024-11-06 23:59:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:57,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569759948] [2024-11-06 23:59:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:57,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:57,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:59:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:57,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:57,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:59:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:57,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:59:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:57,406 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-06 23:59:57,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:57,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569759948] [2024-11-06 23:59:57,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569759948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:57,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:57,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:57,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695944616] [2024-11-06 23:59:57,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:57,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:57,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:57,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:57,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:57,408 INFO L87 Difference]: Start difference. First operand 3601 states and 5423 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:58,407 INFO L93 Difference]: Finished difference Result 8279 states and 12661 transitions. [2024-11-06 23:59:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:59:58,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-06 23:59:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:58,428 INFO L225 Difference]: With dead ends: 8279 [2024-11-06 23:59:58,429 INFO L226 Difference]: Without dead ends: 4692 [2024-11-06 23:59:58,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:59:58,440 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 728 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:58,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 622 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 23:59:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2024-11-06 23:59:58,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 3601. [2024-11-06 23:59:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3601 states, 3239 states have (on average 1.489039827107132) internal successors, (4823), 3256 states have internal predecessors, (4823), 243 states have call successors, (243), 102 states have call predecessors, (243), 118 states have return successors, (340), 258 states have call predecessors, (340), 243 states have call successors, (340) [2024-11-06 23:59:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 5406 transitions. [2024-11-06 23:59:58,721 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 5406 transitions. Word has length 115 [2024-11-06 23:59:58,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:58,721 INFO L471 AbstractCegarLoop]: Abstraction has 3601 states and 5406 transitions. [2024-11-06 23:59:58,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 5406 transitions. [2024-11-06 23:59:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-06 23:59:58,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:58,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:58,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 23:59:58,726 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:58,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:58,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1960320201, now seen corresponding path program 1 times [2024-11-06 23:59:58,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:58,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121400167] [2024-11-06 23:59:58,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:58,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:59:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:59:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:59:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,887 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-06 23:59:58,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:58,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121400167] [2024-11-06 23:59:58,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121400167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:58,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:58,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:58,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895011653] [2024-11-06 23:59:58,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:58,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:58,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:58,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:58,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:58,890 INFO L87 Difference]: Start difference. First operand 3601 states and 5406 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:01,091 INFO L93 Difference]: Finished difference Result 13699 states and 20791 transitions. [2024-11-07 00:00:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 00:00:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-07 00:00:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:01,140 INFO L225 Difference]: With dead ends: 13699 [2024-11-07 00:00:01,140 INFO L226 Difference]: Without dead ends: 10112 [2024-11-07 00:00:01,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:00:01,155 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1082 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:01,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1484 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 00:00:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10112 states. [2024-11-07 00:00:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10112 to 6955. [2024-11-07 00:00:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6955 states, 6273 states have (on average 1.4887613582018173) internal successors, (9339), 6306 states have internal predecessors, (9339), 451 states have call successors, (451), 198 states have call predecessors, (451), 230 states have return successors, (726), 482 states have call predecessors, (726), 451 states have call successors, (726) [2024-11-07 00:00:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6955 states to 6955 states and 10516 transitions. [2024-11-07 00:00:01,644 INFO L78 Accepts]: Start accepts. Automaton has 6955 states and 10516 transitions. Word has length 115 [2024-11-07 00:00:01,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:01,644 INFO L471 AbstractCegarLoop]: Abstraction has 6955 states and 10516 transitions. [2024-11-07 00:00:01,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6955 states and 10516 transitions. [2024-11-07 00:00:01,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 00:00:01,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:01,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:01,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:00:01,656 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:01,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash 19738187, now seen corresponding path program 1 times [2024-11-07 00:00:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:01,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958924532] [2024-11-07 00:00:01,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:01,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:01,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:01,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 00:00:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:00:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 00:00:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:01,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:01,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958924532] [2024-11-07 00:00:01,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958924532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:01,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:01,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:01,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455612702] [2024-11-07 00:00:01,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:01,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:01,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:01,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:01,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:01,820 INFO L87 Difference]: Start difference. First operand 6955 states and 10516 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:04,412 INFO L93 Difference]: Finished difference Result 26123 states and 39887 transitions. [2024-11-07 00:00:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 00:00:04,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-07 00:00:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:04,524 INFO L225 Difference]: With dead ends: 26123 [2024-11-07 00:00:04,524 INFO L226 Difference]: Without dead ends: 19182 [2024-11-07 00:00:04,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:00:04,551 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 1042 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:04,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 1484 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2078 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 00:00:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19182 states. [2024-11-07 00:00:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19182 to 13644. [2024-11-07 00:00:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13644 states, 12338 states have (on average 1.4897876479170045) internal successors, (18381), 12403 states have internal predecessors, (18381), 851 states have call successors, (851), 390 states have call predecessors, (851), 454 states have return successors, (1644), 914 states have call predecessors, (1644), 851 states have call successors, (1644) [2024-11-07 00:00:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13644 states to 13644 states and 20876 transitions. [2024-11-07 00:00:05,714 INFO L78 Accepts]: Start accepts. Automaton has 13644 states and 20876 transitions. Word has length 115 [2024-11-07 00:00:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:05,714 INFO L471 AbstractCegarLoop]: Abstraction has 13644 states and 20876 transitions. [2024-11-07 00:00:05,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 13644 states and 20876 transitions. [2024-11-07 00:00:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 00:00:05,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:05,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:05,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:00:05,742 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:05,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:05,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1896801417, now seen corresponding path program 1 times [2024-11-07 00:00:05,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:05,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583819312] [2024-11-07 00:00:05,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:05,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:05,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:05,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 00:00:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:00:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 00:00:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:05,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:05,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583819312] [2024-11-07 00:00:05,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583819312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:05,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:05,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:05,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648283272] [2024-11-07 00:00:05,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:05,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:05,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:05,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:05,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:05,931 INFO L87 Difference]: Start difference. First operand 13644 states and 20876 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:10,053 INFO L93 Difference]: Finished difference Result 50378 states and 77781 transitions. [2024-11-07 00:00:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 00:00:10,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-07 00:00:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:10,251 INFO L225 Difference]: With dead ends: 50378 [2024-11-07 00:00:10,251 INFO L226 Difference]: Without dead ends: 36748 [2024-11-07 00:00:10,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:00:10,304 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 935 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:10,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 1484 Invalid, 2372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 00:00:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36748 states. [2024-11-07 00:00:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36748 to 26989. [2024-11-07 00:00:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 24467 states have (on average 1.4916009318674133) internal successors, (36495), 24596 states have internal predecessors, (36495), 1619 states have call successors, (1619), 774 states have call predecessors, (1619), 902 states have return successors, (3934), 1746 states have call predecessors, (3934), 1619 states have call successors, (3934) [2024-11-07 00:00:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 42048 transitions. [2024-11-07 00:00:12,342 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 42048 transitions. Word has length 115 [2024-11-07 00:00:12,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:12,343 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 42048 transitions. [2024-11-07 00:00:12,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 42048 transitions. [2024-11-07 00:00:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 00:00:12,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:12,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:12,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:00:12,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:12,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1126067851, now seen corresponding path program 1 times [2024-11-07 00:00:12,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:12,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073811212] [2024-11-07 00:00:12,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:12,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:12,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:12,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:12,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 00:00:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:12,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:00:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:12,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 00:00:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:12,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:12,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073811212] [2024-11-07 00:00:12,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073811212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:12,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:12,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:12,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221223995] [2024-11-07 00:00:12,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:12,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:12,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:12,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:12,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:12,556 INFO L87 Difference]: Start difference. First operand 26989 states and 42048 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:15,491 INFO L93 Difference]: Finished difference Result 60853 states and 96604 transitions. [2024-11-07 00:00:15,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:00:15,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-07 00:00:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:15,821 INFO L225 Difference]: With dead ends: 60853 [2024-11-07 00:00:15,821 INFO L226 Difference]: Without dead ends: 33878 [2024-11-07 00:00:15,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:00:15,892 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 636 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:15,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 746 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:00:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33878 states. [2024-11-07 00:00:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33878 to 26989. [2024-11-07 00:00:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 24467 states have (on average 1.4863285241345485) internal successors, (36366), 24596 states have internal predecessors, (36366), 1619 states have call successors, (1619), 774 states have call predecessors, (1619), 902 states have return successors, (3934), 1746 states have call predecessors, (3934), 1619 states have call successors, (3934) [2024-11-07 00:00:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 41919 transitions. [2024-11-07 00:00:17,526 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 41919 transitions. Word has length 115 [2024-11-07 00:00:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:17,527 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 41919 transitions. [2024-11-07 00:00:17,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 41919 transitions. [2024-11-07 00:00:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 00:00:17,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:17,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:17,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:00:17,565 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:17,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash 539791629, now seen corresponding path program 1 times [2024-11-07 00:00:17,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:17,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618890883] [2024-11-07 00:00:17,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:17,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:17,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:17,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:17,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 00:00:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:17,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:00:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:17,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 00:00:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:17,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618890883] [2024-11-07 00:00:17,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618890883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:17,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:17,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:17,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179601990] [2024-11-07 00:00:17,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:17,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:17,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:17,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:17,743 INFO L87 Difference]: Start difference. First operand 26989 states and 41919 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:21,222 INFO L93 Difference]: Finished difference Result 59699 states and 93203 transitions. [2024-11-07 00:00:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:00:21,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-07 00:00:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:21,440 INFO L225 Difference]: With dead ends: 59699 [2024-11-07 00:00:21,441 INFO L226 Difference]: Without dead ends: 32725 [2024-11-07 00:00:21,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:00:21,565 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 286 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:21,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1003 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:00:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32725 states. [2024-11-07 00:00:23,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32725 to 26992. [2024-11-07 00:00:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26992 states, 24470 states have (on average 1.4810380057212913) internal successors, (36241), 24599 states have internal predecessors, (36241), 1619 states have call successors, (1619), 774 states have call predecessors, (1619), 902 states have return successors, (3934), 1746 states have call predecessors, (3934), 1619 states have call successors, (3934) [2024-11-07 00:00:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26992 states to 26992 states and 41794 transitions. [2024-11-07 00:00:23,784 INFO L78 Accepts]: Start accepts. Automaton has 26992 states and 41794 transitions. Word has length 115 [2024-11-07 00:00:23,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:23,784 INFO L471 AbstractCegarLoop]: Abstraction has 26992 states and 41794 transitions. [2024-11-07 00:00:23,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:23,784 INFO L276 IsEmpty]: Start isEmpty. Operand 26992 states and 41794 transitions. [2024-11-07 00:00:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 00:00:23,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:23,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:23,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:00:23,820 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:23,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:23,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1378825291, now seen corresponding path program 1 times [2024-11-07 00:00:23,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:23,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963631529] [2024-11-07 00:00:23,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:23,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:23,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:23,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:23,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 00:00:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:23,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:00:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 00:00:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:23,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:23,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963631529] [2024-11-07 00:00:23,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963631529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:23,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:23,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:23,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388723666] [2024-11-07 00:00:23,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:23,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:23,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:23,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:23,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:23,986 INFO L87 Difference]: Start difference. First operand 26992 states and 41794 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:26,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:26,396 INFO L93 Difference]: Finished difference Result 60092 states and 93469 transitions. [2024-11-07 00:00:26,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 00:00:26,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2024-11-07 00:00:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:26,586 INFO L225 Difference]: With dead ends: 60092 [2024-11-07 00:00:26,586 INFO L226 Difference]: Without dead ends: 33115 [2024-11-07 00:00:26,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 00:00:26,691 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 299 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:26,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1003 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:00:26,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33115 states. [2024-11-07 00:00:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33115 to 27379. [2024-11-07 00:00:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27379 states, 24857 states have (on average 1.473548698555739) internal successors, (36628), 24986 states have internal predecessors, (36628), 1619 states have call successors, (1619), 774 states have call predecessors, (1619), 902 states have return successors, (3934), 1746 states have call predecessors, (3934), 1619 states have call successors, (3934) [2024-11-07 00:00:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27379 states to 27379 states and 42181 transitions. [2024-11-07 00:00:28,613 INFO L78 Accepts]: Start accepts. Automaton has 27379 states and 42181 transitions. Word has length 115 [2024-11-07 00:00:28,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:28,613 INFO L471 AbstractCegarLoop]: Abstraction has 27379 states and 42181 transitions. [2024-11-07 00:00:28,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 27379 states and 42181 transitions. [2024-11-07 00:00:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 00:00:28,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:28,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:28,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:00:28,638 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:28,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1455726089, now seen corresponding path program 1 times [2024-11-07 00:00:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:28,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567991818] [2024-11-07 00:00:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:28,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:28,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:28,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:28,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 00:00:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:28,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:00:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:28,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 00:00:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:28,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:28,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567991818] [2024-11-07 00:00:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567991818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:28,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:28,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:28,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829425436] [2024-11-07 00:00:28,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:28,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:28,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:28,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:28,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:28,823 INFO L87 Difference]: Start difference. First operand 27379 states and 42181 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)