/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-c0cc359-1-104_1a-drivers--usb--serial--qcserial.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:35:29,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:35:29,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:35:29,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:35:29,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:35:29,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:35:29,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:35:29,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:35:29,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:35:29,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:35:29,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:35:29,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:35:29,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:35:29,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:35:29,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:35:29,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:35:29,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:35:29,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:35:29,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:35:29,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:35:29,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:35:29,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:35:29,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:35:29,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:35:29,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:35:29,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:35:29,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:35:29,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:35:29,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:35:29,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:35:29,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:35:29,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:35:29,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:35:29,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:35:29,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:35:30,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:35:30,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:35:30,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:35:30,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:35:30,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:35:30,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:35:30,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:35:30,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:35:30,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:35:30,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:35:30,033 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:35:30,034 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:35:30,034 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:35:30,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:35:30,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:35:30,035 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:35:30,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:35:30,036 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:35:30,036 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:35:30,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:35:30,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:35:30,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:35:30,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:35:30,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:35:30,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:35:30,037 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:35:30,038 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:35:30,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:35:30,038 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:35:30,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:35:30,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:35:30,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:35:30,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:35:30,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:35:30,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:35:30,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:35:30,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:35:30,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:35:30,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:35:30,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:35:30,041 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 21:35:30,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:35:30,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:35:30,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:35:30,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:35:30,471 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:35:30,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-c0cc359-1-104_1a-drivers--usb--serial--qcserial.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-15 21:35:30,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4038338b6/15d2847978a04dbf9ce7f689c8ed0975/FLAGc728621f0 [2022-10-15 21:35:31,523 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:35:31,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-c0cc359-1-104_1a-drivers--usb--serial--qcserial.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-15 21:35:31,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4038338b6/15d2847978a04dbf9ce7f689c8ed0975/FLAGc728621f0 [2022-10-15 21:35:31,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4038338b6/15d2847978a04dbf9ce7f689c8ed0975 [2022-10-15 21:35:31,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:35:31,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:35:31,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:35:31,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:35:31,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:35:31,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:35:31" (1/1) ... [2022-10-15 21:35:31,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33e9fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:31, skipping insertion in model container [2022-10-15 21:35:31,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:35:31" (1/1) ... [2022-10-15 21:35:31,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:35:31,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:35:32,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-c0cc359-1-104_1a-drivers--usb--serial--qcserial.ko-entry_point_ldv-val-v0.8.cil.out.i[133500,133513] [2022-10-15 21:35:32,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:35:32,617 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:35:32,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-c0cc359-1-104_1a-drivers--usb--serial--qcserial.ko-entry_point_ldv-val-v0.8.cil.out.i[133500,133513] [2022-10-15 21:35:32,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:35:33,026 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:35:33,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33 WrapperNode [2022-10-15 21:35:33,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:35:33,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:35:33,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:35:33,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:35:33,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33" (1/1) ... [2022-10-15 21:35:33,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33" (1/1) ... [2022-10-15 21:35:33,212 INFO L138 Inliner]: procedures = 94, calls = 1017, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1810 [2022-10-15 21:35:33,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:35:33,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:35:33,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:35:33,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:35:33,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33" (1/1) ... [2022-10-15 21:35:33,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33" (1/1) ... [2022-10-15 21:35:33,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33" (1/1) ... [2022-10-15 21:35:33,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33" (1/1) ... [2022-10-15 21:35:33,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33" (1/1) ... [2022-10-15 21:35:33,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33" (1/1) ... [2022-10-15 21:35:33,349 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33" (1/1) ... [2022-10-15 21:35:33,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33" (1/1) ... [2022-10-15 21:35:33,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:35:33,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:35:33,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:35:33,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:35:33,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33" (1/1) ... [2022-10-15 21:35:33,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:35:33,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:35:33,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 21:35:33,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 21:35:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:35:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 21:35:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:35:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_serial_data [2022-10-15 21:35:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_serial_data [2022-10-15 21:35:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_open [2022-10-15 21:35:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_open [2022-10-15 21:35:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-15 21:35:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-15 21:35:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:35:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-10-15 21:35:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-10-15 21:35:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2022-10-15 21:35:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2022-10-15 21:35:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-10-15 21:35:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-10-15 21:35:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-10-15 21:35:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-10-15 21:35:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:35:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-10-15 21:35:33,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-10-15 21:35:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_resume [2022-10-15 21:35:33,508 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_resume [2022-10-15 21:35:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:35:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 21:35:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-15 21:35:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-15 21:35:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_disconnect [2022-10-15 21:35:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_disconnect [2022-10-15 21:35:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_deregister [2022-10-15 21:35:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_deregister [2022-10-15 21:35:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_disconnect [2022-10-15 21:35:33,510 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_disconnect [2022-10-15 21:35:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_write [2022-10-15 21:35:33,510 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_write [2022-10-15 21:35:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_write_room [2022-10-15 21:35:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_write_room [2022-10-15 21:35:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_suspend [2022-10-15 21:35:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_suspend [2022-10-15 21:35:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-10-15 21:35:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-10-15 21:35:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-15 21:35:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-15 21:35:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:35:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_close [2022-10-15 21:35:33,512 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_close [2022-10-15 21:35:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:35:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_chars_in_buffer [2022-10-15 21:35:33,512 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_chars_in_buffer [2022-10-15 21:35:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:35:33,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:35:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-10-15 21:35:33,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-10-15 21:35:33,988 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:35:33,994 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:35:34,139 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-15 21:35:35,968 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:35:35,980 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:35:35,980 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 21:35:35,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:35:35 BoogieIcfgContainer [2022-10-15 21:35:35,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:35:35,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:35:35,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:35:35,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:35:35,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:35:31" (1/3) ... [2022-10-15 21:35:35,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7166f6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:35:35, skipping insertion in model container [2022-10-15 21:35:35,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:35:33" (2/3) ... [2022-10-15 21:35:35,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7166f6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:35:35, skipping insertion in model container [2022-10-15 21:35:35,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:35:35" (3/3) ... [2022-10-15 21:35:35,994 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-c0cc359-1-104_1a-drivers--usb--serial--qcserial.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-15 21:35:36,015 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:35:36,015 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-10-15 21:35:36,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:35:36,095 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4001dd02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:35:36,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-10-15 21:35:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 316 states have internal predecessors, (427), 68 states have call successors, (68), 21 states have call predecessors, (68), 20 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2022-10-15 21:35:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-10-15 21:35:36,117 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:36,118 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:36,119 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:35:36,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:36,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1387611450, now seen corresponding path program 1 times [2022-10-15 21:35:36,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:36,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832215777] [2022-10-15 21:35:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:36,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:36,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:35:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:35:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:35:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:37,103 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-10-15 21:35:37,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:37,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832215777] [2022-10-15 21:35:37,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832215777] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:37,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:37,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:35:37,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087598355] [2022-10-15 21:35:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:37,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:35:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:37,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:35:37,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:35:37,149 INFO L87 Difference]: Start difference. First operand has 399 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 316 states have internal predecessors, (427), 68 states have call successors, (68), 21 states have call predecessors, (68), 20 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 21:35:37,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:37,814 INFO L93 Difference]: Finished difference Result 798 states and 1127 transitions. [2022-10-15 21:35:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:35:37,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2022-10-15 21:35:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:37,846 INFO L225 Difference]: With dead ends: 798 [2022-10-15 21:35:37,846 INFO L226 Difference]: Without dead ends: 385 [2022-10-15 21:35:37,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:37,867 INFO L413 NwaCegarLoop]: 549 mSDtfsCounter, 87 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:37,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1643 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 21:35:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-10-15 21:35:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 381. [2022-10-15 21:35:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 285 states have (on average 1.4280701754385965) internal successors, (407), 299 states have internal predecessors, (407), 62 states have call successors, (62), 20 states have call predecessors, (62), 20 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2022-10-15 21:35:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 531 transitions. [2022-10-15 21:35:37,980 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 531 transitions. Word has length 82 [2022-10-15 21:35:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:37,981 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 531 transitions. [2022-10-15 21:35:37,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 21:35:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 531 transitions. [2022-10-15 21:35:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-10-15 21:35:37,986 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:37,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:37,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:35:37,987 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:35:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1481423436, now seen corresponding path program 1 times [2022-10-15 21:35:37,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:37,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976238602] [2022-10-15 21:35:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:35:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:35:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:35:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-10-15 21:35:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:38,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976238602] [2022-10-15 21:35:38,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976238602] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:38,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:38,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:35:38,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133782158] [2022-10-15 21:35:38,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:38,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:38,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:38,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:38,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:38,584 INFO L87 Difference]: Start difference. First operand 381 states and 531 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-10-15 21:35:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:39,508 INFO L93 Difference]: Finished difference Result 1057 states and 1481 transitions. [2022-10-15 21:35:39,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:35:39,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2022-10-15 21:35:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:39,521 INFO L225 Difference]: With dead ends: 1057 [2022-10-15 21:35:39,521 INFO L226 Difference]: Without dead ends: 696 [2022-10-15 21:35:39,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:35:39,524 INFO L413 NwaCegarLoop]: 575 mSDtfsCounter, 558 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:39,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2028 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-15 21:35:39,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-10-15 21:35:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 683. [2022-10-15 21:35:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 518 states have (on average 1.4266409266409266) internal successors, (739), 533 states have internal predecessors, (739), 114 states have call successors, (114), 37 states have call predecessors, (114), 37 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2022-10-15 21:35:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 967 transitions. [2022-10-15 21:35:39,597 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 967 transitions. Word has length 82 [2022-10-15 21:35:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:39,598 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 967 transitions. [2022-10-15 21:35:39,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-10-15 21:35:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 967 transitions. [2022-10-15 21:35:39,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-10-15 21:35:39,611 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:39,611 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:39,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:35:39,612 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:35:39,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash 60506802, now seen corresponding path program 1 times [2022-10-15 21:35:39,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:39,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173933719] [2022-10-15 21:35:39,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:35:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:35:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:35:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-10-15 21:35:40,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:40,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173933719] [2022-10-15 21:35:40,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173933719] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:40,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:40,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:35:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628131985] [2022-10-15 21:35:40,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:40,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:40,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:40,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:40,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:40,158 INFO L87 Difference]: Start difference. First operand 683 states and 967 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-10-15 21:35:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:40,742 INFO L93 Difference]: Finished difference Result 1469 states and 2070 transitions. [2022-10-15 21:35:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:35:40,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 91 [2022-10-15 21:35:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:40,757 INFO L225 Difference]: With dead ends: 1469 [2022-10-15 21:35:40,758 INFO L226 Difference]: Without dead ends: 806 [2022-10-15 21:35:40,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:35:40,769 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 226 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:40,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1557 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 21:35:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-10-15 21:35:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 796. [2022-10-15 21:35:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 615 states have (on average 1.424390243902439) internal successors, (876), 630 states have internal predecessors, (876), 122 states have call successors, (122), 45 states have call predecessors, (122), 45 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2022-10-15 21:35:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1120 transitions. [2022-10-15 21:35:40,848 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1120 transitions. Word has length 91 [2022-10-15 21:35:40,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:40,849 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1120 transitions. [2022-10-15 21:35:40,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-10-15 21:35:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1120 transitions. [2022-10-15 21:35:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-10-15 21:35:40,859 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:40,859 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:40,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:35:40,860 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:35:40,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:40,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1215453035, now seen corresponding path program 1 times [2022-10-15 21:35:40,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:40,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411470462] [2022-10-15 21:35:40,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:40,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:35:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:35:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:35:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:35:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-10-15 21:35:41,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:41,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411470462] [2022-10-15 21:35:41,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411470462] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:41,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:41,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:35:41,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873465105] [2022-10-15 21:35:41,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:41,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:35:41,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:41,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:35:41,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:35:41,544 INFO L87 Difference]: Start difference. First operand 796 states and 1120 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-10-15 21:35:42,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:42,275 INFO L93 Difference]: Finished difference Result 2137 states and 3120 transitions. [2022-10-15 21:35:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:35:42,276 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), 1 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 115 [2022-10-15 21:35:42,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:42,286 INFO L225 Difference]: With dead ends: 2137 [2022-10-15 21:35:42,287 INFO L226 Difference]: Without dead ends: 1375 [2022-10-15 21:35:42,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:35:42,290 INFO L413 NwaCegarLoop]: 827 mSDtfsCounter, 1010 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:42,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1899 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:35:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2022-10-15 21:35:42,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 780. [2022-10-15 21:35:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 601 states have (on average 1.4259567387687189) internal successors, (857), 617 states have internal predecessors, (857), 121 states have call successors, (121), 44 states have call predecessors, (121), 44 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2022-10-15 21:35:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1099 transitions. [2022-10-15 21:35:42,378 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1099 transitions. Word has length 115 [2022-10-15 21:35:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:42,379 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1099 transitions. [2022-10-15 21:35:42,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-10-15 21:35:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1099 transitions. [2022-10-15 21:35:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-10-15 21:35:42,385 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:42,385 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:42,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:35:42,387 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:35:42,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2052164086, now seen corresponding path program 1 times [2022-10-15 21:35:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:42,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826589387] [2022-10-15 21:35:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:35:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:35:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:35:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 21:35:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-15 21:35:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:42,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:35:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:43,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:43,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-10-15 21:35:43,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:43,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826589387] [2022-10-15 21:35:43,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826589387] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:43,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:43,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:35:43,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642753554] [2022-10-15 21:35:43,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:43,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:43,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:43,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:43,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:43,022 INFO L87 Difference]: Start difference. First operand 780 states and 1099 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:35:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:43,578 INFO L93 Difference]: Finished difference Result 1530 states and 2166 transitions. [2022-10-15 21:35:43,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:35:43,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 152 [2022-10-15 21:35:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:43,585 INFO L225 Difference]: With dead ends: 1530 [2022-10-15 21:35:43,585 INFO L226 Difference]: Without dead ends: 784 [2022-10-15 21:35:43,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:35:43,588 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 515 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:43,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1506 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:35:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-10-15 21:35:43,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 780. [2022-10-15 21:35:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 601 states have (on average 1.399334442595674) internal successors, (841), 617 states have internal predecessors, (841), 121 states have call successors, (121), 44 states have call predecessors, (121), 44 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2022-10-15 21:35:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1083 transitions. [2022-10-15 21:35:43,665 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1083 transitions. Word has length 152 [2022-10-15 21:35:43,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:43,667 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1083 transitions. [2022-10-15 21:35:43,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:35:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1083 transitions. [2022-10-15 21:35:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-10-15 21:35:43,670 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:43,671 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:43,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:35:43,671 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:35:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1448486276, now seen corresponding path program 1 times [2022-10-15 21:35:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:43,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612750790] [2022-10-15 21:35:43,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:35:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:35:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:35:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 21:35:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-15 21:35:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:35:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-10-15 21:35:44,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:44,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612750790] [2022-10-15 21:35:44,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612750790] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:44,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:44,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:35:44,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164406807] [2022-10-15 21:35:44,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:44,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:44,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:44,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:44,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:44,254 INFO L87 Difference]: Start difference. First operand 780 states and 1083 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:35:45,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:45,037 INFO L93 Difference]: Finished difference Result 1508 states and 2112 transitions. [2022-10-15 21:35:45,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:35:45,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 152 [2022-10-15 21:35:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:45,049 INFO L225 Difference]: With dead ends: 1508 [2022-10-15 21:35:45,049 INFO L226 Difference]: Without dead ends: 1504 [2022-10-15 21:35:45,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:35:45,053 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 553 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:45,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1662 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:35:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2022-10-15 21:35:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1492. [2022-10-15 21:35:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1162 states have (on average 1.4018932874354562) internal successors, (1629), 1187 states have internal predecessors, (1629), 234 states have call successors, (234), 84 states have call predecessors, (234), 82 states have return successors, (234), 224 states have call predecessors, (234), 234 states have call successors, (234) [2022-10-15 21:35:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2097 transitions. [2022-10-15 21:35:45,173 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2097 transitions. Word has length 152 [2022-10-15 21:35:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:45,174 INFO L495 AbstractCegarLoop]: Abstraction has 1492 states and 2097 transitions. [2022-10-15 21:35:45,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:35:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2097 transitions. [2022-10-15 21:35:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-10-15 21:35:45,179 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:45,179 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:45,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:35:45,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:35:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1945452474, now seen corresponding path program 1 times [2022-10-15 21:35:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:45,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669295522] [2022-10-15 21:35:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:45,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:35:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:35:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:35:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 21:35:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-15 21:35:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:35:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-10-15 21:35:45,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:45,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669295522] [2022-10-15 21:35:45,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669295522] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:45,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:45,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:35:45,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836248609] [2022-10-15 21:35:45,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:45,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:35:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:45,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:35:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:35:45,713 INFO L87 Difference]: Start difference. First operand 1492 states and 2097 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-10-15 21:35:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:46,671 INFO L93 Difference]: Finished difference Result 4410 states and 6212 transitions. [2022-10-15 21:35:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:35:46,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 157 [2022-10-15 21:35:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:46,690 INFO L225 Difference]: With dead ends: 4410 [2022-10-15 21:35:46,690 INFO L226 Difference]: Without dead ends: 2952 [2022-10-15 21:35:46,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:35:46,696 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 750 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 2621 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:46,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 2621 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 21:35:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2022-10-15 21:35:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1500. [2022-10-15 21:35:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1170 states have (on average 1.399145299145299) internal successors, (1637), 1195 states have internal predecessors, (1637), 234 states have call successors, (234), 84 states have call predecessors, (234), 82 states have return successors, (234), 224 states have call predecessors, (234), 234 states have call successors, (234) [2022-10-15 21:35:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2105 transitions. [2022-10-15 21:35:46,849 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2105 transitions. Word has length 157 [2022-10-15 21:35:46,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:46,850 INFO L495 AbstractCegarLoop]: Abstraction has 1500 states and 2105 transitions. [2022-10-15 21:35:46,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-10-15 21:35:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2105 transitions. [2022-10-15 21:35:46,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-10-15 21:35:46,853 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:46,854 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:46,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 21:35:46,854 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:35:46,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1031326303, now seen corresponding path program 1 times [2022-10-15 21:35:46,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:46,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414956829] [2022-10-15 21:35:46,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:46,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:35:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:35:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:35:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:35:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 21:35:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 21:35:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-10-15 21:35:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-10-15 21:35:47,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:47,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414956829] [2022-10-15 21:35:47,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414956829] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:47,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:47,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:35:47,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809390320] [2022-10-15 21:35:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:47,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:47,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:47,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:47,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:47,480 INFO L87 Difference]: Start difference. First operand 1500 states and 2105 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:35:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:48,555 INFO L93 Difference]: Finished difference Result 2970 states and 4178 transitions. [2022-10-15 21:35:48,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:35:48,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 164 [2022-10-15 21:35:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:48,574 INFO L225 Difference]: With dead ends: 2970 [2022-10-15 21:35:48,574 INFO L226 Difference]: Without dead ends: 2960 [2022-10-15 21:35:48,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:35:48,577 INFO L413 NwaCegarLoop]: 560 mSDtfsCounter, 579 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:48,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1950 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 21:35:48,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2022-10-15 21:35:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 2952. [2022-10-15 21:35:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2952 states, 2318 states have (on average 1.3869715271786023) internal successors, (3215), 2355 states have internal predecessors, (3215), 460 states have call successors, (460), 164 states have call predecessors, (460), 160 states have return successors, (460), 440 states have call predecessors, (460), 460 states have call successors, (460) [2022-10-15 21:35:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 4135 transitions. [2022-10-15 21:35:48,908 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 4135 transitions. Word has length 164 [2022-10-15 21:35:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:48,910 INFO L495 AbstractCegarLoop]: Abstraction has 2952 states and 4135 transitions. [2022-10-15 21:35:48,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:35:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 4135 transitions. [2022-10-15 21:35:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-10-15 21:35:48,916 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:48,916 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:48,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:35:48,917 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:35:48,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:48,917 INFO L85 PathProgramCache]: Analyzing trace with hash 446728512, now seen corresponding path program 1 times [2022-10-15 21:35:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:48,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860137756] [2022-10-15 21:35:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:35:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:35:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:35:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 21:35:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-15 21:35:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:35:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-10-15 21:35:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-10-15 21:35:49,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:49,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860137756] [2022-10-15 21:35:49,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860137756] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:49,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:49,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:35:49,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092510941] [2022-10-15 21:35:49,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:49,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:35:49,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:49,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:35:49,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:35:49,611 INFO L87 Difference]: Start difference. First operand 2952 states and 4135 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:35:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:50,549 INFO L93 Difference]: Finished difference Result 7456 states and 10782 transitions. [2022-10-15 21:35:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:35:50,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 171 [2022-10-15 21:35:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:50,579 INFO L225 Difference]: With dead ends: 7456 [2022-10-15 21:35:50,579 INFO L226 Difference]: Without dead ends: 4538 [2022-10-15 21:35:50,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:35:50,588 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 432 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:50,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2273 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 21:35:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4538 states. [2022-10-15 21:35:50,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4538 to 2964. [2022-10-15 21:35:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2964 states, 2330 states have (on average 1.3815450643776823) internal successors, (3219), 2367 states have internal predecessors, (3219), 460 states have call successors, (460), 164 states have call predecessors, (460), 160 states have return successors, (460), 440 states have call predecessors, (460), 460 states have call successors, (460) [2022-10-15 21:35:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 4139 transitions. [2022-10-15 21:35:50,897 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 4139 transitions. Word has length 171 [2022-10-15 21:35:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:50,898 INFO L495 AbstractCegarLoop]: Abstraction has 2964 states and 4139 transitions. [2022-10-15 21:35:50,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:35:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 4139 transitions. [2022-10-15 21:35:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-10-15 21:35:50,903 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:50,903 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:50,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 21:35:50,904 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:35:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:50,904 INFO L85 PathProgramCache]: Analyzing trace with hash 53701502, now seen corresponding path program 1 times [2022-10-15 21:35:50,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:50,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665234626] [2022-10-15 21:35:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:50,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:35:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:35:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:35:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 21:35:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-15 21:35:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:35:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-10-15 21:35:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-10-15 21:35:51,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:51,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665234626] [2022-10-15 21:35:51,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665234626] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:51,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:51,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:35:51,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058837899] [2022-10-15 21:35:51,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:51,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:35:51,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:51,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:35:51,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:35:51,735 INFO L87 Difference]: Start difference. First operand 2964 states and 4139 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 21:35:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:53,328 INFO L93 Difference]: Finished difference Result 4468 states and 6226 transitions. [2022-10-15 21:35:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 21:35:53,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 171 [2022-10-15 21:35:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:53,356 INFO L225 Difference]: With dead ends: 4468 [2022-10-15 21:35:53,356 INFO L226 Difference]: Without dead ends: 4466 [2022-10-15 21:35:53,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-10-15 21:35:53,359 INFO L413 NwaCegarLoop]: 625 mSDtfsCounter, 1200 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 566 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 566 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:53,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 2408 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [566 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-10-15 21:35:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4466 states. [2022-10-15 21:35:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4466 to 4440. [2022-10-15 21:35:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 3500 states have (on average 1.3802857142857143) internal successors, (4831), 3543 states have internal predecessors, (4831), 686 states have call successors, (686), 244 states have call predecessors, (686), 240 states have return successors, (686), 664 states have call predecessors, (686), 686 states have call successors, (686) [2022-10-15 21:35:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6203 transitions. [2022-10-15 21:35:53,901 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6203 transitions. Word has length 171 [2022-10-15 21:35:53,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:53,902 INFO L495 AbstractCegarLoop]: Abstraction has 4440 states and 6203 transitions. [2022-10-15 21:35:53,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 21:35:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6203 transitions. [2022-10-15 21:35:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-10-15 21:35:53,907 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:53,908 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:53,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 21:35:53,908 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:35:53,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1664746652, now seen corresponding path program 1 times [2022-10-15 21:35:53,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:53,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897377927] [2022-10-15 21:35:53,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:53,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:35:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:35:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:35:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 21:35:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-15 21:35:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:35:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-10-15 21:35:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-10-15 21:35:54,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:54,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897377927] [2022-10-15 21:35:54,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897377927] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:54,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:54,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:35:54,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025092263] [2022-10-15 21:35:54,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:54,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:35:54,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:54,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:35:54,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:35:54,831 INFO L87 Difference]: Start difference. First operand 4440 states and 6203 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 21:35:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:56,815 INFO L93 Difference]: Finished difference Result 7334 states and 10270 transitions. [2022-10-15 21:35:56,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 21:35:56,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 172 [2022-10-15 21:35:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:56,889 INFO L225 Difference]: With dead ends: 7334 [2022-10-15 21:35:56,890 INFO L226 Difference]: Without dead ends: 7332 [2022-10-15 21:35:56,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-10-15 21:35:56,897 INFO L413 NwaCegarLoop]: 1035 mSDtfsCounter, 1143 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 3701 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:56,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 3701 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-10-15 21:35:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7332 states. [2022-10-15 21:35:57,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7332 to 7252. [2022-10-15 21:35:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7252 states, 5744 states have (on average 1.3842270194986073) internal successors, (7951), 5815 states have internal predecessors, (7951), 1106 states have call successors, (1106), 396 states have call predecessors, (1106), 388 states have return successors, (1106), 1060 states have call predecessors, (1106), 1106 states have call successors, (1106) [2022-10-15 21:35:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7252 states to 7252 states and 10163 transitions. [2022-10-15 21:35:57,640 INFO L78 Accepts]: Start accepts. Automaton has 7252 states and 10163 transitions. Word has length 172 [2022-10-15 21:35:57,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:35:57,640 INFO L495 AbstractCegarLoop]: Abstraction has 7252 states and 10163 transitions. [2022-10-15 21:35:57,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 21:35:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7252 states and 10163 transitions. [2022-10-15 21:35:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-10-15 21:35:57,648 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:35:57,648 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:35:57,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 21:35:57,649 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:35:57,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:35:57,649 INFO L85 PathProgramCache]: Analyzing trace with hash 134636988, now seen corresponding path program 1 times [2022-10-15 21:35:57,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:35:57,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477621333] [2022-10-15 21:35:57,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:35:57,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:35:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:57,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:35:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:35:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:35:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:35:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:35:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:35:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:35:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 21:35:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 21:35:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-10-15 21:35:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:35:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:35:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-10-15 21:35:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-15 21:35:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:35:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-10-15 21:35:58,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:35:58,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477621333] [2022-10-15 21:35:58,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477621333] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:35:58,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:35:58,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:35:58,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507210152] [2022-10-15 21:35:58,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:35:58,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:35:58,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:35:58,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:35:58,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:35:58,209 INFO L87 Difference]: Start difference. First operand 7252 states and 10163 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-15 21:35:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:35:59,485 INFO L93 Difference]: Finished difference Result 16038 states and 22577 transitions. [2022-10-15 21:35:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:35:59,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 176 [2022-10-15 21:35:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:35:59,538 INFO L225 Difference]: With dead ends: 16038 [2022-10-15 21:35:59,538 INFO L226 Difference]: Without dead ends: 8820 [2022-10-15 21:35:59,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:35:59,571 INFO L413 NwaCegarLoop]: 928 mSDtfsCounter, 517 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:35:59,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1923 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 21:35:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2022-10-15 21:36:00,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 8788. [2022-10-15 21:36:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8788 states, 6977 states have (on average 1.377382829296259) internal successors, (9610), 7060 states have internal predecessors, (9610), 1338 states have call successors, (1338), 469 states have call predecessors, (1338), 459 states have return successors, (1338), 1283 states have call predecessors, (1338), 1338 states have call successors, (1338) [2022-10-15 21:36:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8788 states to 8788 states and 12286 transitions. [2022-10-15 21:36:00,591 INFO L78 Accepts]: Start accepts. Automaton has 8788 states and 12286 transitions. Word has length 176 [2022-10-15 21:36:00,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:00,592 INFO L495 AbstractCegarLoop]: Abstraction has 8788 states and 12286 transitions. [2022-10-15 21:36:00,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-15 21:36:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 8788 states and 12286 transitions. [2022-10-15 21:36:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-10-15 21:36:00,599 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:00,599 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:00,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 21:36:00,600 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:36:00,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1680643227, now seen corresponding path program 1 times [2022-10-15 21:36:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:00,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416609615] [2022-10-15 21:36:00,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:00,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:36:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:00,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:00,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:00,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:36:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:00,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:00,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:00,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:36:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:00,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:00,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:36:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:36:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:36:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:36:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 21:36:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 21:36:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-10-15 21:36:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-10-15 21:36:01,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:01,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416609615] [2022-10-15 21:36:01,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416609615] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:36:01,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:36:01,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:36:01,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928016614] [2022-10-15 21:36:01,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:36:01,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:36:01,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:01,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:36:01,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:36:01,133 INFO L87 Difference]: Start difference. First operand 8788 states and 12286 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-10-15 21:36:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:02,746 INFO L93 Difference]: Finished difference Result 15848 states and 22265 transitions. [2022-10-15 21:36:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:36:02,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 175 [2022-10-15 21:36:02,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:02,814 INFO L225 Difference]: With dead ends: 15848 [2022-10-15 21:36:02,814 INFO L226 Difference]: Without dead ends: 10536 [2022-10-15 21:36:02,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:36:02,843 INFO L413 NwaCegarLoop]: 944 mSDtfsCounter, 480 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 3197 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:02,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 3197 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 21:36:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10536 states. [2022-10-15 21:36:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10536 to 10514. [2022-10-15 21:36:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10514 states, 8360 states have (on average 1.3778708133971291) internal successors, (11519), 8455 states have internal predecessors, (11519), 1590 states have call successors, (1590), 562 states have call predecessors, (1590), 550 states have return successors, (1590), 1526 states have call predecessors, (1590), 1590 states have call successors, (1590) [2022-10-15 21:36:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10514 states to 10514 states and 14699 transitions. [2022-10-15 21:36:03,833 INFO L78 Accepts]: Start accepts. Automaton has 10514 states and 14699 transitions. Word has length 175 [2022-10-15 21:36:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:03,834 INFO L495 AbstractCegarLoop]: Abstraction has 10514 states and 14699 transitions. [2022-10-15 21:36:03,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-10-15 21:36:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 10514 states and 14699 transitions. [2022-10-15 21:36:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-10-15 21:36:03,841 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:03,841 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:03,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 21:36:03,842 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:36:03,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2021796630, now seen corresponding path program 1 times [2022-10-15 21:36:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:03,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040385375] [2022-10-15 21:36:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:36:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:36:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:36:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:36:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:36:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:36:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:36:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 21:36:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 21:36:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-10-15 21:36:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-15 21:36:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-10-15 21:36:04,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:04,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040385375] [2022-10-15 21:36:04,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040385375] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:36:04,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119140055] [2022-10-15 21:36:04,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:04,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:36:04,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:36:04,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:36:04,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 21:36:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:05,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 2944 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:36:05,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:36:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-10-15 21:36:05,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:36:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-10-15 21:36:05,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119140055] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:36:05,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:36:05,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 9 [2022-10-15 21:36:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487310192] [2022-10-15 21:36:05,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:36:05,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 21:36:05,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:05,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 21:36:05,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:36:05,882 INFO L87 Difference]: Start difference. First operand 10514 states and 14699 transitions. Second operand has 10 states, 9 states have (on average 17.22222222222222) internal successors, (155), 7 states have internal predecessors, (155), 6 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (25), 6 states have call predecessors, (25), 6 states have call successors, (25) [2022-10-15 21:36:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:10,250 INFO L93 Difference]: Finished difference Result 28544 states and 40044 transitions. [2022-10-15 21:36:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-15 21:36:10,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 17.22222222222222) internal successors, (155), 7 states have internal predecessors, (155), 6 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (25), 6 states have call predecessors, (25), 6 states have call successors, (25) Word has length 180 [2022-10-15 21:36:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:10,398 INFO L225 Difference]: With dead ends: 28544 [2022-10-15 21:36:10,399 INFO L226 Difference]: Without dead ends: 28539 [2022-10-15 21:36:10,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2022-10-15 21:36:10,419 INFO L413 NwaCegarLoop]: 732 mSDtfsCounter, 2864 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 950 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3107 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 950 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:10,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3107 Valid, 2694 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [950 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-10-15 21:36:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28539 states. [2022-10-15 21:36:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28539 to 21405. [2022-10-15 21:36:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21405 states, 17045 states have (on average 1.3754180111469638) internal successors, (23444), 17221 states have internal predecessors, (23444), 3232 states have call successors, (3232), 1139 states have call predecessors, (3232), 1117 states have return successors, (3232), 3105 states have call predecessors, (3232), 3232 states have call successors, (3232) [2022-10-15 21:36:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21405 states to 21405 states and 29908 transitions. [2022-10-15 21:36:12,241 INFO L78 Accepts]: Start accepts. Automaton has 21405 states and 29908 transitions. Word has length 180 [2022-10-15 21:36:12,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:12,244 INFO L495 AbstractCegarLoop]: Abstraction has 21405 states and 29908 transitions. [2022-10-15 21:36:12,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 17.22222222222222) internal successors, (155), 7 states have internal predecessors, (155), 6 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (25), 6 states have call predecessors, (25), 6 states have call successors, (25) [2022-10-15 21:36:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 21405 states and 29908 transitions. [2022-10-15 21:36:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-10-15 21:36:12,253 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:12,253 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:12,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 21:36:12,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-15 21:36:12,467 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_freeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-15 21:36:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1748814820, now seen corresponding path program 1 times [2022-10-15 21:36:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:12,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106277620] [2022-10-15 21:36:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:12,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:36:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 21:36:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:36:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 21:36:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 21:36:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:36:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 21:36:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 21:36:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 21:36:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-10-15 21:36:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:36:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:36:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-15 21:36:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-10-15 21:36:13,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:13,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106277620] [2022-10-15 21:36:13,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106277620] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:36:13,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233794561] [2022-10-15 21:36:13,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:13,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:36:13,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:36:13,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:36:13,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 21:36:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:13,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 2945 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:36:13,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:36:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-10-15 21:36:14,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:36:14,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233794561] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:36:14,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:36:14,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-10-15 21:36:14,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078170015] [2022-10-15 21:36:14,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:36:14,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:36:14,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:14,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:36:14,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:36:14,147 INFO L87 Difference]: Start difference. First operand 21405 states and 29908 transitions. Second operand has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)