./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.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/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.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', '5202e6cfdb0072b2d97423b078e60556fe6d43d8002548ceef037df7f02499eb'] 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/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.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 5202e6cfdb0072b2d97423b078e60556fe6d43d8002548ceef037df7f02499eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:48:08,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:48:08,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:48:08,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:48:08,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:48:08,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:48:08,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:48:08,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:48:08,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:48:08,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:48:08,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:48:08,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:48:08,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:48:08,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:48:08,625 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:48:08,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:48:08,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:48:08,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:48:08,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:48:08,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:48:08,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:48:08,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:48:08,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:48:08,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:48:08,626 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:48:08,626 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:48:08,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:48:08,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:48:08,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:48:08,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:48:08,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:48:08,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:48:08,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:48:08,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:48:08,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:48:08,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:48:08,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:48:08,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:48:08,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:48:08,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:48:08,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:48:08,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:48:08,628 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 -> 5202e6cfdb0072b2d97423b078e60556fe6d43d8002548ceef037df7f02499eb [2024-11-07 01:48:08,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:48:08,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:48:08,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:48:08,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:48:08,857 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:48:08,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c [2024-11-07 01:48:09,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:48:10,176 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:48:10,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c [2024-11-07 01:48:10,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da9172cf1/828f4ed929f84d37b174808d26c47a61/FLAG83c5a593b [2024-11-07 01:48:10,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da9172cf1/828f4ed929f84d37b174808d26c47a61 [2024-11-07 01:48:10,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:48:10,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:48:10,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:48:10,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:48:10,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:48:10,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bc3718b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10, skipping insertion in model container [2024-11-07 01:48:10,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:48:10,658 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/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c[911,924] [2024-11-07 01:48:10,710 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/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c[8416,8429] [2024-11-07 01:48:10,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:48:10,781 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:48:10,789 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/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c[911,924] [2024-11-07 01:48:10,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/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c[8416,8429] [2024-11-07 01:48:10,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:48:10,854 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:48:10,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10 WrapperNode [2024-11-07 01:48:10,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:48:10,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:48:10,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:48:10,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:48:10,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,915 INFO L138 Inliner]: procedures = 71, calls = 85, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 866 [2024-11-07 01:48:10,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:48:10,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:48:10,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:48:10,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:48:10,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,949 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:48:10,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:10,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:48:10,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:48:10,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:48:10,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:48:10,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (1/1) ... [2024-11-07 01:48:11,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:48:11,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:48:11,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:48:11,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:48:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:48:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:48:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:48:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:48:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:48:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:48:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:48:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:48:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:48:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:48:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:48:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:48:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:48:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:48:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:48:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:48:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:48:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:48:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:48:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:48:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:48:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:48:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:48:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:48:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:48:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:48:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:48:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:48:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:48:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:48:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:48:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:48:11,126 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:48:11,128 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:48:11,625 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-07 01:48:11,625 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-07 01:48:11,760 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-07 01:48:11,760 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:48:11,777 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:48:11,781 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-07 01:48:11,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:48:11 BoogieIcfgContainer [2024-11-07 01:48:11,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:48:11,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:48:11,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:48:11,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:48:11,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:48:10" (1/3) ... [2024-11-07 01:48:11,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de393dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:48:11, skipping insertion in model container [2024-11-07 01:48:11,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:10" (2/3) ... [2024-11-07 01:48:11,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de393dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:48:11, skipping insertion in model container [2024-11-07 01:48:11,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:48:11" (3/3) ... [2024-11-07 01:48:11,789 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.08.cil-1.c [2024-11-07 01:48:11,800 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:48:11,800 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:48:11,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:48:11,853 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;@3a187ff3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:48:11,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:48:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 408 states, 353 states have (on average 1.6033994334277621) internal successors, (566), 359 states have internal predecessors, (566), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 01:48:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:48:11,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:11,864 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] [2024-11-07 01:48:11,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:11,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:11,867 INFO L85 PathProgramCache]: Analyzing trace with hash -462714198, now seen corresponding path program 1 times [2024-11-07 01:48:11,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:11,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837697397] [2024-11-07 01:48:11,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:11,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:48:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:48:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:12,257 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 01:48:12,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:12,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837697397] [2024-11-07 01:48:12,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837697397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:12,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:12,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:12,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404032293] [2024-11-07 01:48:12,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:12,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:12,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:12,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:12,279 INFO L87 Difference]: Start difference. First operand has 408 states, 353 states have (on average 1.6033994334277621) internal successors, (566), 359 states have internal predecessors, (566), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:13,280 INFO L93 Difference]: Finished difference Result 943 states and 1479 transitions. [2024-11-07 01:48:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:48:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:48:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:13,290 INFO L225 Difference]: With dead ends: 943 [2024-11-07 01:48:13,290 INFO L226 Difference]: Without dead ends: 549 [2024-11-07 01:48:13,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:48:13,297 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1054 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:13,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 1797 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:48:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-07 01:48:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 510. [2024-11-07 01:48:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 435 states have (on average 1.4965517241379311) internal successors, (651), 441 states have internal predecessors, (651), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2024-11-07 01:48:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 756 transitions. [2024-11-07 01:48:13,374 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 756 transitions. Word has length 65 [2024-11-07 01:48:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:13,375 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 756 transitions. [2024-11-07 01:48:13,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 756 transitions. [2024-11-07 01:48:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:48:13,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:13,380 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] [2024-11-07 01:48:13,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:48:13,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:13,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1216174442, now seen corresponding path program 1 times [2024-11-07 01:48:13,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:13,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015873423] [2024-11-07 01:48:13,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:13,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:48:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:48:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,605 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 01:48:13,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:13,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015873423] [2024-11-07 01:48:13,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015873423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:13,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:13,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:13,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301312899] [2024-11-07 01:48:13,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:13,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:13,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:13,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:13,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:13,607 INFO L87 Difference]: Start difference. First operand 510 states and 756 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:14,651 INFO L93 Difference]: Finished difference Result 907 states and 1322 transitions. [2024-11-07 01:48:14,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:48:14,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:48:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:14,660 INFO L225 Difference]: With dead ends: 907 [2024-11-07 01:48:14,660 INFO L226 Difference]: Without dead ends: 698 [2024-11-07 01:48:14,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:48:14,661 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 1158 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:14,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 2134 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:48:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-07 01:48:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 622. [2024-11-07 01:48:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 525 states have (on average 1.48) internal successors, (777), 533 states have internal predecessors, (777), 64 states have call successors, (64), 28 states have call predecessors, (64), 31 states have return successors, (75), 64 states have call predecessors, (75), 62 states have call successors, (75) [2024-11-07 01:48:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 916 transitions. [2024-11-07 01:48:14,714 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 916 transitions. Word has length 65 [2024-11-07 01:48:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:14,714 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 916 transitions. [2024-11-07 01:48:14,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 916 transitions. [2024-11-07 01:48:14,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:48:14,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:14,718 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] [2024-11-07 01:48:14,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:48:14,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:14,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash -812411668, now seen corresponding path program 1 times [2024-11-07 01:48:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:14,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894043027] [2024-11-07 01:48:14,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:14,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:14,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:14,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:14,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:14,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:48:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:14,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:48:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:14,842 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 01:48:14,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:14,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894043027] [2024-11-07 01:48:14,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894043027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:14,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:14,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:14,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13393369] [2024-11-07 01:48:14,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:14,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:14,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:14,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:14,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:14,844 INFO L87 Difference]: Start difference. First operand 622 states and 916 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:48:15,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:15,605 INFO L93 Difference]: Finished difference Result 1294 states and 1858 transitions. [2024-11-07 01:48:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:48:15,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-07 01:48:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:15,610 INFO L225 Difference]: With dead ends: 1294 [2024-11-07 01:48:15,610 INFO L226 Difference]: Without dead ends: 979 [2024-11-07 01:48:15,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:48:15,611 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 1269 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:15,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1667 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:48:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-07 01:48:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 903. [2024-11-07 01:48:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 751 states have (on average 1.4434087882822904) internal successors, (1084), 763 states have internal predecessors, (1084), 94 states have call successors, (94), 49 states have call predecessors, (94), 56 states have return successors, (113), 94 states have call predecessors, (113), 92 states have call successors, (113) [2024-11-07 01:48:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1291 transitions. [2024-11-07 01:48:15,650 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1291 transitions. Word has length 65 [2024-11-07 01:48:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:15,650 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1291 transitions. [2024-11-07 01:48:15,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:48:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1291 transitions. [2024-11-07 01:48:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:48:15,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:15,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:15,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:48:15,652 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:15,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:15,652 INFO L85 PathProgramCache]: Analyzing trace with hash 494446571, now seen corresponding path program 1 times [2024-11-07 01:48:15,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:15,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995577494] [2024-11-07 01:48:15,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:15,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:48:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:48:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:48:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,809 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 01:48:15,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:15,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995577494] [2024-11-07 01:48:15,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995577494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:15,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:48:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985795612] [2024-11-07 01:48:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:15,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:48:15,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:15,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:48:15,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:48:15,810 INFO L87 Difference]: Start difference. First operand 903 states and 1291 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:48:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:16,660 INFO L93 Difference]: Finished difference Result 1571 states and 2218 transitions. [2024-11-07 01:48:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:48:16,661 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-07 01:48:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:16,665 INFO L225 Difference]: With dead ends: 1571 [2024-11-07 01:48:16,665 INFO L226 Difference]: Without dead ends: 975 [2024-11-07 01:48:16,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:48:16,667 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 504 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:16,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2410 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:48:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-07 01:48:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 918. [2024-11-07 01:48:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 763 states have (on average 1.432503276539974) internal successors, (1093), 775 states have internal predecessors, (1093), 94 states have call successors, (94), 49 states have call predecessors, (94), 59 states have return successors, (116), 97 states have call predecessors, (116), 92 states have call successors, (116) [2024-11-07 01:48:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1303 transitions. [2024-11-07 01:48:16,704 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1303 transitions. Word has length 66 [2024-11-07 01:48:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:16,704 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1303 transitions. [2024-11-07 01:48:16,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:48:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1303 transitions. [2024-11-07 01:48:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:48:16,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:16,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:16,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:48:16,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:16,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:16,708 INFO L85 PathProgramCache]: Analyzing trace with hash -534912727, now seen corresponding path program 1 times [2024-11-07 01:48:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:16,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067328207] [2024-11-07 01:48:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:16,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:48:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:48:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:48:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,854 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 01:48:16,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:16,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067328207] [2024-11-07 01:48:16,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067328207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:16,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:16,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:48:16,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977223356] [2024-11-07 01:48:16,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:48:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:16,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:48:16,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:48:16,855 INFO L87 Difference]: Start difference. First operand 918 states and 1303 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:48:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:18,415 INFO L93 Difference]: Finished difference Result 3123 states and 4424 transitions. [2024-11-07 01:48:18,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 01:48:18,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2024-11-07 01:48:18,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:18,422 INFO L225 Difference]: With dead ends: 3123 [2024-11-07 01:48:18,422 INFO L226 Difference]: Without dead ends: 1281 [2024-11-07 01:48:18,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 01:48:18,427 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 2384 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 2100 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 2100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:18,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2401 Valid, 2103 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 2100 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:48:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2024-11-07 01:48:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1126. [2024-11-07 01:48:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 915 states have (on average 1.3956284153005465) internal successors, (1277), 931 states have internal predecessors, (1277), 124 states have call successors, (124), 70 states have call predecessors, (124), 85 states have return successors, (165), 128 states have call predecessors, (165), 122 states have call successors, (165) [2024-11-07 01:48:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1566 transitions. [2024-11-07 01:48:18,476 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1566 transitions. Word has length 66 [2024-11-07 01:48:18,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:18,476 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1566 transitions. [2024-11-07 01:48:18,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:48:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1566 transitions. [2024-11-07 01:48:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:48:18,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:18,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:18,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:48:18,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:18,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:18,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1164222712, now seen corresponding path program 1 times [2024-11-07 01:48:18,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:18,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373991906] [2024-11-07 01:48:18,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:18,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:18,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:18,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:48:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:18,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:48:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:18,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:48:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:18,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:48:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:18,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:48:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:18,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:48:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:18,628 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 01:48:18,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:18,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373991906] [2024-11-07 01:48:18,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373991906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:18,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:18,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:48:18,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510541688] [2024-11-07 01:48:18,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:18,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:48:18,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:18,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:48:18,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:48:18,630 INFO L87 Difference]: Start difference. First operand 1126 states and 1566 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:48:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:19,397 INFO L93 Difference]: Finished difference Result 2311 states and 3191 transitions. [2024-11-07 01:48:19,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 01:48:19,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2024-11-07 01:48:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:19,401 INFO L225 Difference]: With dead ends: 2311 [2024-11-07 01:48:19,401 INFO L226 Difference]: Without dead ends: 287 [2024-11-07 01:48:19,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-07 01:48:19,406 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1313 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:19,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 2006 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:48:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-07 01:48:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-07 01:48:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 258 states have (on average 1.5387596899224807) internal successors, (397), 259 states have internal predecessors, (397), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 01:48:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 441 transitions. [2024-11-07 01:48:19,415 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 441 transitions. Word has length 67 [2024-11-07 01:48:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:19,415 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 441 transitions. [2024-11-07 01:48:19,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:48:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 441 transitions. [2024-11-07 01:48:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:19,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:19,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:19,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:48:19,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:19,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:19,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1987291879, now seen corresponding path program 1 times [2024-11-07 01:48:19,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:19,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116956521] [2024-11-07 01:48:19,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:19,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,550 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 01:48:19,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:19,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116956521] [2024-11-07 01:48:19,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116956521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:19,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:19,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:48:19,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929863456] [2024-11-07 01:48:19,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:19,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:48:19,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:19,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:48:19,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:48:19,551 INFO L87 Difference]: Start difference. First operand 287 states and 441 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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-07 01:48:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:20,309 INFO L93 Difference]: Finished difference Result 663 states and 1038 transitions. [2024-11-07 01:48:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:48:20,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:20,312 INFO L225 Difference]: With dead ends: 663 [2024-11-07 01:48:20,312 INFO L226 Difference]: Without dead ends: 385 [2024-11-07 01:48:20,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:20,313 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 741 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:20,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 571 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:48:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-07 01:48:20,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 287. [2024-11-07 01:48:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 258 states have (on average 1.5348837209302326) internal successors, (396), 259 states have internal predecessors, (396), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 01:48:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 440 transitions. [2024-11-07 01:48:20,325 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 440 transitions. Word has length 134 [2024-11-07 01:48:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:20,325 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 440 transitions. [2024-11-07 01:48:20,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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-07 01:48:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 440 transitions. [2024-11-07 01:48:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:20,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:20,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:20,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:48:20,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:20,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:20,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1360637531, now seen corresponding path program 1 times [2024-11-07 01:48:20,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:20,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577402662] [2024-11-07 01:48:20,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:20,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:20,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:20,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:20,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:20,454 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 01:48:20,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577402662] [2024-11-07 01:48:20,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577402662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:20,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:20,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:48:20,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703646988] [2024-11-07 01:48:20,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:20,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:48:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:20,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:48:20,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:48:20,455 INFO L87 Difference]: Start difference. First operand 287 states and 440 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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 01:48:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:21,623 INFO L93 Difference]: Finished difference Result 1033 states and 1625 transitions. [2024-11-07 01:48:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:48:21,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:21,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:21,626 INFO L225 Difference]: With dead ends: 1033 [2024-11-07 01:48:21,626 INFO L226 Difference]: Without dead ends: 763 [2024-11-07 01:48:21,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:48:21,627 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1110 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:21,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 974 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:48:21,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-11-07 01:48:21,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 568. [2024-11-07 01:48:21,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 515 states have (on average 1.5475728155339805) internal successors, (797), 517 states have internal predecessors, (797), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-11-07 01:48:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 878 transitions. [2024-11-07 01:48:21,649 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 878 transitions. Word has length 134 [2024-11-07 01:48:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:21,649 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 878 transitions. [2024-11-07 01:48:21,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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 01:48:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 878 transitions. [2024-11-07 01:48:21,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:21,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:21,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:21,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:48:21,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:21,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash -345866017, now seen corresponding path program 1 times [2024-11-07 01:48:21,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:21,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466707985] [2024-11-07 01:48:21,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:21,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,819 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 01:48:21,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:21,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466707985] [2024-11-07 01:48:21,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466707985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:21,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:21,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:21,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862361420] [2024-11-07 01:48:21,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:21,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:21,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:21,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:21,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:21,821 INFO L87 Difference]: Start difference. First operand 568 states and 878 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:23,523 INFO L93 Difference]: Finished difference Result 1704 states and 2681 transitions. [2024-11-07 01:48:23,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:48:23,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:23,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:23,528 INFO L225 Difference]: With dead ends: 1704 [2024-11-07 01:48:23,528 INFO L226 Difference]: Without dead ends: 1153 [2024-11-07 01:48:23,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:48:23,529 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 1127 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:23,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 1871 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:48:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-07 01:48:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 830. [2024-11-07 01:48:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 753 states have (on average 1.5405046480743692) internal successors, (1160), 756 states have internal predecessors, (1160), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-11-07 01:48:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1277 transitions. [2024-11-07 01:48:23,584 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1277 transitions. Word has length 134 [2024-11-07 01:48:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:23,584 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1277 transitions. [2024-11-07 01:48:23,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:23,585 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1277 transitions. [2024-11-07 01:48:23,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:23,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:23,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:23,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:48:23,586 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:23,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:23,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1656020253, now seen corresponding path program 1 times [2024-11-07 01:48:23,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:23,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439500259] [2024-11-07 01:48:23,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:23,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:23,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:23,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:23,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:23,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:23,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:23,741 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 01:48:23,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:23,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439500259] [2024-11-07 01:48:23,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439500259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:23,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:23,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:23,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888038678] [2024-11-07 01:48:23,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:23,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:23,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:23,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:23,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:23,742 INFO L87 Difference]: Start difference. First operand 830 states and 1277 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:25,447 INFO L93 Difference]: Finished difference Result 2693 states and 4226 transitions. [2024-11-07 01:48:25,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:48:25,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:25,454 INFO L225 Difference]: With dead ends: 2693 [2024-11-07 01:48:25,454 INFO L226 Difference]: Without dead ends: 1880 [2024-11-07 01:48:25,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:48:25,456 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1131 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:25,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1869 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:48:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2024-11-07 01:48:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1355. [2024-11-07 01:48:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1230 states have (on average 1.5341463414634147) internal successors, (1887), 1235 states have internal predecessors, (1887), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-11-07 01:48:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2080 transitions. [2024-11-07 01:48:25,511 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 2080 transitions. Word has length 134 [2024-11-07 01:48:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:25,511 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 2080 transitions. [2024-11-07 01:48:25,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2080 transitions. [2024-11-07 01:48:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:25,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:25,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:25,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:48:25,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:25,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:25,513 INFO L85 PathProgramCache]: Analyzing trace with hash -911802081, now seen corresponding path program 1 times [2024-11-07 01:48:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66872503] [2024-11-07 01:48:25,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:25,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:25,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:25,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:25,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:25,675 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 01:48:25,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:25,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66872503] [2024-11-07 01:48:25,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66872503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:25,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:25,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:25,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616579138] [2024-11-07 01:48:25,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:25,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:25,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:25,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:25,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:25,677 INFO L87 Difference]: Start difference. First operand 1355 states and 2080 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:27,446 INFO L93 Difference]: Finished difference Result 4595 states and 7181 transitions. [2024-11-07 01:48:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:48:27,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:27,457 INFO L225 Difference]: With dead ends: 4595 [2024-11-07 01:48:27,457 INFO L226 Difference]: Without dead ends: 3257 [2024-11-07 01:48:27,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:48:27,461 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1127 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:27,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 1869 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:48:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2024-11-07 01:48:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 2411. [2024-11-07 01:48:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2190 states have (on average 1.5301369863013699) internal successors, (3351), 2199 states have internal predecessors, (3351), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-07 01:48:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3702 transitions. [2024-11-07 01:48:27,573 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3702 transitions. Word has length 134 [2024-11-07 01:48:27,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:27,573 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 3702 transitions. [2024-11-07 01:48:27,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:27,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3702 transitions. [2024-11-07 01:48:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:27,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:27,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:27,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:48:27,576 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:27,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1735802273, now seen corresponding path program 1 times [2024-11-07 01:48:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:27,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992311851] [2024-11-07 01:48:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:27,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:27,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:27,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:27,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:27,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:27,716 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 01:48:27,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:27,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992311851] [2024-11-07 01:48:27,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992311851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:27,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:27,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:27,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431475562] [2024-11-07 01:48:27,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:27,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:27,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:27,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:27,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:27,717 INFO L87 Difference]: Start difference. First operand 2411 states and 3702 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:28,688 INFO L93 Difference]: Finished difference Result 5666 states and 8856 transitions. [2024-11-07 01:48:28,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:48:28,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:28,698 INFO L225 Difference]: With dead ends: 5666 [2024-11-07 01:48:28,698 INFO L226 Difference]: Without dead ends: 3272 [2024-11-07 01:48:28,702 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-07 01:48:28,702 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 989 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:28,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 790 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:48:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2024-11-07 01:48:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 2411. [2024-11-07 01:48:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2190 states have (on average 1.526027397260274) internal successors, (3342), 2199 states have internal predecessors, (3342), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-07 01:48:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3693 transitions. [2024-11-07 01:48:28,824 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3693 transitions. Word has length 134 [2024-11-07 01:48:28,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:28,825 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 3693 transitions. [2024-11-07 01:48:28,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3693 transitions. [2024-11-07 01:48:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:28,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:28,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:28,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:48:28,827 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:28,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash -395548449, now seen corresponding path program 1 times [2024-11-07 01:48:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:28,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244139747] [2024-11-07 01:48:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:28,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:28,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:28,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:28,962 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 01:48:28,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:28,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244139747] [2024-11-07 01:48:28,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244139747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:28,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:28,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086618995] [2024-11-07 01:48:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:28,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:28,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:28,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:28,963 INFO L87 Difference]: Start difference. First operand 2411 states and 3693 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:29,954 INFO L93 Difference]: Finished difference Result 5656 states and 8809 transitions. [2024-11-07 01:48:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:48:29,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:29,965 INFO L225 Difference]: With dead ends: 5656 [2024-11-07 01:48:29,965 INFO L226 Difference]: Without dead ends: 3262 [2024-11-07 01:48:29,969 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-07 01:48:29,970 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 819 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:29,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 943 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:48:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-11-07 01:48:30,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2411. [2024-11-07 01:48:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2190 states have (on average 1.521917808219178) internal successors, (3333), 2199 states have internal predecessors, (3333), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-07 01:48:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3684 transitions. [2024-11-07 01:48:30,099 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3684 transitions. Word has length 134 [2024-11-07 01:48:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:30,099 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 3684 transitions. [2024-11-07 01:48:30,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3684 transitions. [2024-11-07 01:48:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:30,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:30,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:30,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:48:30,102 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:30,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:30,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1434133023, now seen corresponding path program 1 times [2024-11-07 01:48:30,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:30,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751454100] [2024-11-07 01:48:30,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:30,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:30,226 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 01:48:30,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:30,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751454100] [2024-11-07 01:48:30,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751454100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:30,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:30,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:30,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909615512] [2024-11-07 01:48:30,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:30,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:30,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:30,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:30,227 INFO L87 Difference]: Start difference. First operand 2411 states and 3684 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:31,230 INFO L93 Difference]: Finished difference Result 5646 states and 8762 transitions. [2024-11-07 01:48:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:48:31,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:31,241 INFO L225 Difference]: With dead ends: 5646 [2024-11-07 01:48:31,241 INFO L226 Difference]: Without dead ends: 3252 [2024-11-07 01:48:31,244 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-07 01:48:31,245 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 817 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:31,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 943 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:48:31,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2024-11-07 01:48:31,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 2411. [2024-11-07 01:48:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2190 states have (on average 1.5178082191780822) internal successors, (3324), 2199 states have internal predecessors, (3324), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-07 01:48:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3675 transitions. [2024-11-07 01:48:31,362 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3675 transitions. Word has length 134 [2024-11-07 01:48:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:31,363 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 3675 transitions. [2024-11-07 01:48:31,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:31,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3675 transitions. [2024-11-07 01:48:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:31,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:31,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:31,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:48:31,366 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:31,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash 887668895, now seen corresponding path program 1 times [2024-11-07 01:48:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:31,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566315292] [2024-11-07 01:48:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,511 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 01:48:31,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:31,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566315292] [2024-11-07 01:48:31,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566315292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:31,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:31,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456534664] [2024-11-07 01:48:31,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:31,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:31,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:31,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:31,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:31,512 INFO L87 Difference]: Start difference. First operand 2411 states and 3675 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:33,330 INFO L93 Difference]: Finished difference Result 8379 states and 12933 transitions. [2024-11-07 01:48:33,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:48:33,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:33,347 INFO L225 Difference]: With dead ends: 8379 [2024-11-07 01:48:33,348 INFO L226 Difference]: Without dead ends: 5985 [2024-11-07 01:48:33,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:48:33,352 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1105 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:33,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 1869 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2413 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:48:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2024-11-07 01:48:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 4555. [2024-11-07 01:48:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4555 states, 4142 states have (on average 1.5123128923225495) internal successors, (6264), 4159 states have internal predecessors, (6264), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-11-07 01:48:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4555 states to 4555 states and 6949 transitions. [2024-11-07 01:48:33,634 INFO L78 Accepts]: Start accepts. Automaton has 4555 states and 6949 transitions. Word has length 134 [2024-11-07 01:48:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:33,634 INFO L471 AbstractCegarLoop]: Abstraction has 4555 states and 6949 transitions. [2024-11-07 01:48:33,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6949 transitions. [2024-11-07 01:48:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:33,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:33,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:33,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:48:33,637 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:33,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:33,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1254191583, now seen corresponding path program 1 times [2024-11-07 01:48:33,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:33,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6698490] [2024-11-07 01:48:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:33,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:33,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:33,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:33,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:33,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:33,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:33,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:33,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6698490] [2024-11-07 01:48:33,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6698490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:33,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:33,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:33,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507317822] [2024-11-07 01:48:33,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:33,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:33,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:33,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:33,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:33,762 INFO L87 Difference]: Start difference. First operand 4555 states and 6949 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:36,083 INFO L93 Difference]: Finished difference Result 17945 states and 27687 transitions. [2024-11-07 01:48:36,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:48:36,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:36,121 INFO L225 Difference]: With dead ends: 17945 [2024-11-07 01:48:36,121 INFO L226 Difference]: Without dead ends: 13407 [2024-11-07 01:48:36,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:48:36,131 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 1187 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 2925 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 2982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:36,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 1859 Invalid, 2982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2925 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:48:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13407 states. [2024-11-07 01:48:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13407 to 8804. [2024-11-07 01:48:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8804 states, 8023 states have (on average 1.5109061448336034) internal successors, (12122), 8056 states have internal predecessors, (12122), 550 states have call successors, (550), 198 states have call predecessors, (550), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2024-11-07 01:48:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8804 states to 8804 states and 13497 transitions. [2024-11-07 01:48:36,663 INFO L78 Accepts]: Start accepts. Automaton has 8804 states and 13497 transitions. Word has length 134 [2024-11-07 01:48:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:36,664 INFO L471 AbstractCegarLoop]: Abstraction has 8804 states and 13497 transitions. [2024-11-07 01:48:36,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 8804 states and 13497 transitions. [2024-11-07 01:48:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:36,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:36,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:36,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:48:36,669 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:36,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1877473185, now seen corresponding path program 1 times [2024-11-07 01:48:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:36,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507725972] [2024-11-07 01:48:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:36,802 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 01:48:36,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:36,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507725972] [2024-11-07 01:48:36,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507725972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:36,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:36,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:36,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840735734] [2024-11-07 01:48:36,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:36,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:36,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:36,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:36,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:36,803 INFO L87 Difference]: Start difference. First operand 8804 states and 13497 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:39,651 INFO L93 Difference]: Finished difference Result 34608 states and 53629 transitions. [2024-11-07 01:48:39,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:48:39,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:39,734 INFO L225 Difference]: With dead ends: 34608 [2024-11-07 01:48:39,735 INFO L226 Difference]: Without dead ends: 25821 [2024-11-07 01:48:39,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:48:39,762 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 1399 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:39,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 1855 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:48:39,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25821 states. [2024-11-07 01:48:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25821 to 17125. [2024-11-07 01:48:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17125 states, 15624 states have (on average 1.5102406554019456) internal successors, (23596), 15689 states have internal predecessors, (23596), 1046 states have call successors, (1046), 390 states have call predecessors, (1046), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-11-07 01:48:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17125 states to 17125 states and 26481 transitions. [2024-11-07 01:48:40,696 INFO L78 Accepts]: Start accepts. Automaton has 17125 states and 26481 transitions. Word has length 134 [2024-11-07 01:48:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:40,697 INFO L471 AbstractCegarLoop]: Abstraction has 17125 states and 26481 transitions. [2024-11-07 01:48:40,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 17125 states and 26481 transitions. [2024-11-07 01:48:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:40,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:40,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:40,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:48:40,704 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:40,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:40,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1759031711, now seen corresponding path program 1 times [2024-11-07 01:48:40,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:40,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202901777] [2024-11-07 01:48:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:40,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,863 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 01:48:40,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:40,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202901777] [2024-11-07 01:48:40,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202901777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:40,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:40,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:40,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803393536] [2024-11-07 01:48:40,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:40,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:40,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:40,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:40,865 INFO L87 Difference]: Start difference. First operand 17125 states and 26481 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:44,822 INFO L93 Difference]: Finished difference Result 65901 states and 103007 transitions. [2024-11-07 01:48:44,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:48:44,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:44,980 INFO L225 Difference]: With dead ends: 65901 [2024-11-07 01:48:44,980 INFO L226 Difference]: Without dead ends: 48793 [2024-11-07 01:48:45,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:48:45,026 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 1317 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:45,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 1859 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:48:45,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48793 states. [2024-11-07 01:48:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48793 to 33959. [2024-11-07 01:48:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33959 states, 31050 states have (on average 1.5123993558776168) internal successors, (46960), 31179 states have internal predecessors, (46960), 2006 states have call successors, (2006), 774 states have call predecessors, (2006), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2024-11-07 01:48:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33959 states to 33959 states and 53287 transitions. [2024-11-07 01:48:47,295 INFO L78 Accepts]: Start accepts. Automaton has 33959 states and 53287 transitions. Word has length 134 [2024-11-07 01:48:47,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:47,296 INFO L471 AbstractCegarLoop]: Abstraction has 33959 states and 53287 transitions. [2024-11-07 01:48:47,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:47,296 INFO L276 IsEmpty]: Start isEmpty. Operand 33959 states and 53287 transitions. [2024-11-07 01:48:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:47,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:47,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:47,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:48:47,316 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:47,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:47,317 INFO L85 PathProgramCache]: Analyzing trace with hash 502541539, now seen corresponding path program 1 times [2024-11-07 01:48:47,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:47,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150973517] [2024-11-07 01:48:47,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:47,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:47,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:47,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:47,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:47,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:47,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:47,454 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 01:48:47,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:47,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150973517] [2024-11-07 01:48:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150973517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:47,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:47,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109364374] [2024-11-07 01:48:47,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:47,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:47,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:47,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:47,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:47,457 INFO L87 Difference]: Start difference. First operand 33959 states and 53287 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:53,627 INFO L93 Difference]: Finished difference Result 128749 states and 204071 transitions. [2024-11-07 01:48:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:48:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 01:48:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:53,933 INFO L225 Difference]: With dead ends: 128749 [2024-11-07 01:48:53,933 INFO L226 Difference]: Without dead ends: 94807 [2024-11-07 01:48:54,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:48:54,031 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1340 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:54,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 1206 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:48:54,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94807 states. [2024-11-07 01:48:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94807 to 67560. [2024-11-07 01:48:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67560 states, 61899 states have (on average 1.5144994264850806) internal successors, (93746), 62156 states have internal predecessors, (93746), 3862 states have call successors, (3862), 1542 states have call predecessors, (3862), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-11-07 01:48:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67560 states to 67560 states and 108287 transitions. [2024-11-07 01:48:58,473 INFO L78 Accepts]: Start accepts. Automaton has 67560 states and 108287 transitions. Word has length 134 [2024-11-07 01:48:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:58,473 INFO L471 AbstractCegarLoop]: Abstraction has 67560 states and 108287 transitions. [2024-11-07 01:48:58,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:48:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 67560 states and 108287 transitions. [2024-11-07 01:48:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:48:58,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:58,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:58,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:48:58,498 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:58,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:58,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1364167135, now seen corresponding path program 1 times [2024-11-07 01:48:58,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:58,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119691488] [2024-11-07 01:48:58,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:58,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:48:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:48:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:48:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:48:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:58,604 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 01:48:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119691488] [2024-11-07 01:48:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119691488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996424486] [2024-11-07 01:48:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:58,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:58,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:58,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:58,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:58,606 INFO L87 Difference]: Start difference. First operand 67560 states and 108287 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:49:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:04,092 INFO L93 Difference]: Finished difference Result 153746 states and 252145 transitions. [2024-11-07 01:49:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 01:49:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:04,343 INFO L225 Difference]: With dead ends: 153746 [2024-11-07 01:49:04,344 INFO L226 Difference]: Without dead ends: 86203 [2024-11-07 01:49:04,464 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-07 01:49:04,465 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 940 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:04,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 789 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:49:04,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86203 states. [2024-11-07 01:49:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86203 to 67560. [2024-11-07 01:49:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67560 states, 61899 states have (on average 1.5103475015751466) internal successors, (93489), 62156 states have internal predecessors, (93489), 3862 states have call successors, (3862), 1542 states have call predecessors, (3862), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-11-07 01:49:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67560 states to 67560 states and 108030 transitions. [2024-11-07 01:49:08,292 INFO L78 Accepts]: Start accepts. Automaton has 67560 states and 108030 transitions. Word has length 134 [2024-11-07 01:49:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:08,293 INFO L471 AbstractCegarLoop]: Abstraction has 67560 states and 108030 transitions. [2024-11-07 01:49:08,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 01:49:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 67560 states and 108030 transitions. [2024-11-07 01:49:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 01:49:08,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:08,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:49:08,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:49:08,317 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:08,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:08,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1623657763, now seen corresponding path program 1 times [2024-11-07 01:49:08,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:08,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496931309] [2024-11-07 01:49:08,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:08,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:49:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:49:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:49:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:49:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,430 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 01:49:08,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:08,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496931309] [2024-11-07 01:49:08,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496931309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:08,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:08,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:08,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323000523] [2024-11-07 01:49:08,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:08,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:08,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:08,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:08,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:08,431 INFO L87 Difference]: Start difference. First operand 67560 states and 108030 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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)