/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:19:18,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:19:18,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 08:19:18,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:19:18,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:19:18,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:19:18,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:19:18,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:19:18,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:19:18,240 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:19:18,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:19:18,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:19:18,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:19:18,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:19:18,242 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:19:18,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:19:18,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:19:18,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:19:18,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:19:18,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:19:18,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:19:18,245 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:19:18,245 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:19:18,245 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:19:18,246 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:19:18,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:19:18,246 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:19:18,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:19:18,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:19:18,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:19:18,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:19:18,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:19:18,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:19:18,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:19:18,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:19:18,249 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:19:18,250 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:19:18,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:19:18,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:19:18,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:19:18,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:19:18,251 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:18,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:19:18,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:19:18,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:19:18,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:19:18,510 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:19:18,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i [2024-11-05 08:19:19,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:19:20,407 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:19:20,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i [2024-11-05 08:19:20,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44931e9a1/30bfbd2783904fd58f1337d17452d94c/FLAG55d831be6 [2024-11-05 08:19:20,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44931e9a1/30bfbd2783904fd58f1337d17452d94c [2024-11-05 08:19:20,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:19:20,587 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:19:20,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:19:20,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:19:20,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:19:20,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:19:20" (1/1) ... [2024-11-05 08:19:20,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd6777d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:20, skipping insertion in model container [2024-11-05 08:19:20,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:19:20" (1/1) ... [2024-11-05 08:19:20,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:19:20,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2024-11-05 08:19:20,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2024-11-05 08:19:21,488 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,578 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,579 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,580 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,588 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,595 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,595 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,596 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,600 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,600 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,601 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,607 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,608 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,613 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,613 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,623 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,624 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,624 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,625 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,631 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,632 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,632 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,633 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,639 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,640 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,640 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,640 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,641 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,643 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:21,904 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,905 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,906 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:21,906 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,001 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:19:22,037 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-05 08:19:22,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:19:22,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2024-11-05 08:19:22,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2024-11-05 08:19:22,120 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,154 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,154 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,155 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,160 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,164 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,165 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,167 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,168 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,168 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,169 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,170 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,170 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,175 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,175 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,181 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,181 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,182 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,182 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,183 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,184 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,185 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,185 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,186 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,186 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,186 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,187 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,187 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,187 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,222 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,222 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,223 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,223 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,246 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:19:22,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:19:22,263 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:19:22,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2024-11-05 08:19:22,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2024-11-05 08:19:22,326 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,326 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,326 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,327 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,331 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,338 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,341 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,342 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,342 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,343 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,343 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,344 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,344 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:22,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:19:22,594 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-05 08:19:22,606 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:19:22,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22 WrapperNode [2024-11-05 08:19:22,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:19:22,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:19:22,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:19:22,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:19:22,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (1/1) ... [2024-11-05 08:19:22,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (1/1) ... [2024-11-05 08:19:22,715 INFO L138 Inliner]: procedures = 687, calls = 1048, calls flagged for inlining = 49, calls inlined = 4, statements flattened = 88 [2024-11-05 08:19:22,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:19:22,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:19:22,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:19:22,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:19:22,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (1/1) ... [2024-11-05 08:19:22,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (1/1) ... [2024-11-05 08:19:22,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (1/1) ... [2024-11-05 08:19:22,766 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 23, 5]. 77 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 7 writes are split as follows [0, 7, 0]. [2024-11-05 08:19:22,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (1/1) ... [2024-11-05 08:19:22,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (1/1) ... [2024-11-05 08:19:22,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (1/1) ... [2024-11-05 08:19:22,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (1/1) ... [2024-11-05 08:19:22,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (1/1) ... [2024-11-05 08:19:22,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (1/1) ... [2024-11-05 08:19:22,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:19:22,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:19:22,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:19:22,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:19:22,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (1/1) ... [2024-11-05 08:19:22,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:19:22,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:19:22,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 08:19:22,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 08:19:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2024-11-05 08:19:22,871 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2024-11-05 08:19:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2024-11-05 08:19:22,872 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2024-11-05 08:19:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:19:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:19:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:19:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:19:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 08:19:22,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 08:19:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:19:22,873 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:19:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:19:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-05 08:19:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-05 08:19:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-05 08:19:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:19:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:19:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-05 08:19:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-05 08:19:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-05 08:19:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-05 08:19:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-05 08:19:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-05 08:19:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-05 08:19:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-05 08:19:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-05 08:19:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:19:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:19:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:19:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-05 08:19:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-05 08:19:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-05 08:19:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-05 08:19:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-05 08:19:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-05 08:19:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2024-11-05 08:19:22,877 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2024-11-05 08:19:23,131 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:19:23,133 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:19:23,519 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-05 08:19:23,519 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:19:23,533 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:19:23,534 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-05 08:19:23,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:19:23 BoogieIcfgContainer [2024-11-05 08:19:23,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:19:23,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:19:23,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:19:23,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:19:23,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:19:20" (1/3) ... [2024-11-05 08:19:23,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fe31d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:19:23, skipping insertion in model container [2024-11-05 08:19:23,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:22" (2/3) ... [2024-11-05 08:19:23,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fe31d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:19:23, skipping insertion in model container [2024-11-05 08:19:23,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:19:23" (3/3) ... [2024-11-05 08:19:23,542 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_remove_harness_negated.i [2024-11-05 08:19:23,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:19:23,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:19:23,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:19:23,606 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@35ea3fdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:19:23,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:19:23,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 50 states have internal predecessors, (62), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-05 08:19:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-05 08:19:23,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:23,617 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 08:19:23,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:23,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:23,622 INFO L85 PathProgramCache]: Analyzing trace with hash -262517723, now seen corresponding path program 1 times [2024-11-05 08:19:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:23,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1852388688] [2024-11-05 08:19:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:23,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:23,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:23,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:23,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 08:19:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:23,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:19:23,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-05 08:19:23,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-05 08:19:23,985 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:23,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1852388688] [2024-11-05 08:19:23,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1852388688] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:19:23,986 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:19:23,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 08:19:23,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830901217] [2024-11-05 08:19:23,988 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:23,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:19:23,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:24,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:19:24,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:19:24,022 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 50 states have internal predecessors, (62), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:24,058 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2024-11-05 08:19:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:19:24,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2024-11-05 08:19:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:24,069 INFO L225 Difference]: With dead ends: 142 [2024-11-05 08:19:24,069 INFO L226 Difference]: Without dead ends: 69 [2024-11-05 08:19:24,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:19:24,077 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:24,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-05 08:19:24,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-05 08:19:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-05 08:19:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2024-11-05 08:19:24,129 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 48 [2024-11-05 08:19:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:24,130 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2024-11-05 08:19:24,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2024-11-05 08:19:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-05 08:19:24,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:24,132 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-05 08:19:24,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 08:19:24,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:24,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:24,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:24,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1590307628, now seen corresponding path program 1 times [2024-11-05 08:19:24,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:24,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [97077089] [2024-11-05 08:19:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:24,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:24,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:24,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:24,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 08:19:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:24,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:19:24,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 08:19:24,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:24,845 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:24,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [97077089] [2024-11-05 08:19:24,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [97077089] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:19:24,846 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:19:24,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2024-11-05 08:19:24,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512704984] [2024-11-05 08:19:24,846 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:24,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:19:24,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:24,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:19:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:19:24,850 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-05 08:19:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:25,096 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2024-11-05 08:19:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:19:25,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 54 [2024-11-05 08:19:25,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:25,099 INFO L225 Difference]: With dead ends: 139 [2024-11-05 08:19:25,099 INFO L226 Difference]: Without dead ends: 78 [2024-11-05 08:19:25,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:19:25,101 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:25,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 351 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:19:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-05 08:19:25,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-05 08:19:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 50 states have internal predecessors, (58), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-05 08:19:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2024-11-05 08:19:25,113 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 54 [2024-11-05 08:19:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:25,113 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2024-11-05 08:19:25,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-05 08:19:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2024-11-05 08:19:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-05 08:19:25,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:25,115 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-05 08:19:25,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 08:19:25,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:25,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:25,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:25,320 INFO L85 PathProgramCache]: Analyzing trace with hash 653675670, now seen corresponding path program 1 times [2024-11-05 08:19:25,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:25,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812681142] [2024-11-05 08:19:25,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:25,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:25,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:25,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:25,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 08:19:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:25,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 08:19:25,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:25,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:25,650 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:25,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812681142] [2024-11-05 08:19:25,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [812681142] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:19:25,650 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:19:25,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 08:19:25,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532957675] [2024-11-05 08:19:25,650 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:25,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:19:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:25,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:19:25,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:19:25,653 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 08:19:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:25,703 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2024-11-05 08:19:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:19:25,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 54 [2024-11-05 08:19:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:25,705 INFO L225 Difference]: With dead ends: 134 [2024-11-05 08:19:25,705 INFO L226 Difference]: Without dead ends: 76 [2024-11-05 08:19:25,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:19:25,707 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:25,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-05 08:19:25,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-05 08:19:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.2) internal successors, (60), 52 states have internal predecessors, (60), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-05 08:19:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2024-11-05 08:19:25,718 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 54 [2024-11-05 08:19:25,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:25,719 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2024-11-05 08:19:25,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 08:19:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2024-11-05 08:19:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-05 08:19:25,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:25,720 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 08:19:25,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 08:19:25,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:25,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:25,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:25,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1140988950, now seen corresponding path program 1 times [2024-11-05 08:19:25,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:25,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [166569112] [2024-11-05 08:19:25,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:25,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:25,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:25,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:25,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 08:19:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:26,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 08:19:26,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:26,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:26,334 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:26,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [166569112] [2024-11-05 08:19:26,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [166569112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:19:26,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:19:26,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-05 08:19:26,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108746653] [2024-11-05 08:19:26,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:19:26,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 08:19:26,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:26,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 08:19:26,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:19:26,337 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 08:19:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:26,503 INFO L93 Difference]: Finished difference Result 138 states and 173 transitions. [2024-11-05 08:19:26,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:19:26,504 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2024-11-05 08:19:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:26,506 INFO L225 Difference]: With dead ends: 138 [2024-11-05 08:19:26,506 INFO L226 Difference]: Without dead ends: 80 [2024-11-05 08:19:26,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-11-05 08:19:26,508 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:26,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 582 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:19:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-05 08:19:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-05 08:19:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-05 08:19:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2024-11-05 08:19:26,528 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 56 [2024-11-05 08:19:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:26,528 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2024-11-05 08:19:26,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 08:19:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2024-11-05 08:19:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-05 08:19:26,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:26,530 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1] [2024-11-05 08:19:26,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-05 08:19:26,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:26,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:26,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:26,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1492130582, now seen corresponding path program 2 times [2024-11-05 08:19:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1323386212] [2024-11-05 08:19:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:26,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:26,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:26,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:26,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 08:19:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:26,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:19:26,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:27,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:27,385 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:27,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1323386212] [2024-11-05 08:19:27,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1323386212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:19:27,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:19:27,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-05 08:19:27,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418930121] [2024-11-05 08:19:27,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:19:27,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-05 08:19:27,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:27,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-05 08:19:27,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-05 08:19:27,388 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 08:19:27,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:27,978 INFO L93 Difference]: Finished difference Result 146 states and 185 transitions. [2024-11-05 08:19:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-05 08:19:27,985 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 60 [2024-11-05 08:19:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:27,986 INFO L225 Difference]: With dead ends: 146 [2024-11-05 08:19:27,986 INFO L226 Difference]: Without dead ends: 88 [2024-11-05 08:19:27,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=347, Unknown=0, NotChecked=0, Total=552 [2024-11-05 08:19:27,988 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:27,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 667 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:19:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-05 08:19:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-05 08:19:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 64 states have internal predecessors, (72), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-05 08:19:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2024-11-05 08:19:28,009 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 60 [2024-11-05 08:19:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:28,010 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2024-11-05 08:19:28,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 08:19:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2024-11-05 08:19:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-05 08:19:28,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:28,012 INFO L215 NwaCegarLoop]: trace histogram [14, 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, 1, 1, 1, 1, 1] [2024-11-05 08:19:28,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-05 08:19:28,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:28,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:28,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:28,216 INFO L85 PathProgramCache]: Analyzing trace with hash 994416918, now seen corresponding path program 3 times [2024-11-05 08:19:28,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:28,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1474733233] [2024-11-05 08:19:28,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:28,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:28,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:28,219 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:28,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 08:19:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:28,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-05 08:19:28,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:28,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:29,487 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:29,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1474733233] [2024-11-05 08:19:29,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1474733233] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:19:29,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:19:29,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-11-05 08:19:29,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903284665] [2024-11-05 08:19:29,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:19:29,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-05 08:19:29,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:29,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-05 08:19:29,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2024-11-05 08:19:29,489 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 08:19:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:30,203 INFO L93 Difference]: Finished difference Result 148 states and 181 transitions. [2024-11-05 08:19:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-05 08:19:30,204 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2024-11-05 08:19:30,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:30,205 INFO L225 Difference]: With dead ends: 148 [2024-11-05 08:19:30,205 INFO L226 Difference]: Without dead ends: 90 [2024-11-05 08:19:30,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2024-11-05 08:19:30,207 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:30,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1741 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-05 08:19:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-05 08:19:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-05 08:19:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.15625) internal successors, (74), 66 states have internal predecessors, (74), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-05 08:19:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-11-05 08:19:30,216 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 68 [2024-11-05 08:19:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:30,217 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-11-05 08:19:30,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 08:19:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-11-05 08:19:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-05 08:19:30,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:30,218 INFO L215 NwaCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1] [2024-11-05 08:19:30,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-05 08:19:30,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:30,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:30,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:30,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2119153514, now seen corresponding path program 4 times [2024-11-05 08:19:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:30,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1462305379] [2024-11-05 08:19:30,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:30,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:30,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:30,421 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:30,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-05 08:19:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:30,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 08:19:30,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-05 08:19:30,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-05 08:19:30,844 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:30,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1462305379] [2024-11-05 08:19:30,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1462305379] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:19:30,844 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:19:30,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2024-11-05 08:19:30,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445208636] [2024-11-05 08:19:30,844 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:30,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:19:30,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:30,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:19:30,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:19:30,846 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-05 08:19:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:30,925 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2024-11-05 08:19:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:19:30,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2024-11-05 08:19:30,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:30,926 INFO L225 Difference]: With dead ends: 100 [2024-11-05 08:19:30,927 INFO L226 Difference]: Without dead ends: 98 [2024-11-05 08:19:30,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:19:30,928 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 6 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:30,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 486 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:30,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-05 08:19:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-05 08:19:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 71 states have internal predecessors, (78), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-11-05 08:19:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2024-11-05 08:19:30,944 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 70 [2024-11-05 08:19:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:30,944 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2024-11-05 08:19:30,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-05 08:19:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2024-11-05 08:19:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-05 08:19:30,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:30,946 INFO L215 NwaCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1] [2024-11-05 08:19:30,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-05 08:19:31,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:31,147 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:31,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash 607751583, now seen corresponding path program 1 times [2024-11-05 08:19:31,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:31,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1501145900] [2024-11-05 08:19:31,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:31,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:31,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:31,149 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:31,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-05 08:19:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:31,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:19:31,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-05 08:19:31,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-05 08:19:31,535 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:31,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1501145900] [2024-11-05 08:19:31,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1501145900] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:19:31,536 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:19:31,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 08:19:31,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689799568] [2024-11-05 08:19:31,537 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:31,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:19:31,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:31,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:19:31,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:19:31,538 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 08:19:31,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:31,572 INFO L93 Difference]: Finished difference Result 153 states and 185 transitions. [2024-11-05 08:19:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:19:31,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2024-11-05 08:19:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:31,575 INFO L225 Difference]: With dead ends: 153 [2024-11-05 08:19:31,575 INFO L226 Difference]: Without dead ends: 103 [2024-11-05 08:19:31,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:19:31,576 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:31,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 246 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-05 08:19:31,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-11-05 08:19:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 75 states have internal predecessors, (83), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-11-05 08:19:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2024-11-05 08:19:31,594 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 70 [2024-11-05 08:19:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:31,595 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2024-11-05 08:19:31,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 08:19:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2024-11-05 08:19:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-05 08:19:31,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:31,596 INFO L215 NwaCegarLoop]: trace histogram [16, 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] [2024-11-05 08:19:31,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-05 08:19:31,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:31,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:31,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:31,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1078305057, now seen corresponding path program 1 times [2024-11-05 08:19:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:31,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [366124373] [2024-11-05 08:19:31,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:31,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:31,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:31,804 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:31,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-05 08:19:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:32,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:19:32,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-05 08:19:32,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-05 08:19:32,348 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:32,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [366124373] [2024-11-05 08:19:32,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [366124373] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:19:32,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:19:32,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-05 08:19:32,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490495979] [2024-11-05 08:19:32,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:19:32,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 08:19:32,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:32,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 08:19:32,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:19:32,350 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 08:19:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:32,555 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2024-11-05 08:19:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:19:32,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2024-11-05 08:19:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:32,557 INFO L225 Difference]: With dead ends: 173 [2024-11-05 08:19:32,557 INFO L226 Difference]: Without dead ends: 123 [2024-11-05 08:19:32,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-11-05 08:19:32,558 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 32 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:32,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 516 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:19:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-05 08:19:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2024-11-05 08:19:32,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 84 states have (on average 1.1785714285714286) internal successors, (99), 87 states have internal predecessors, (99), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-11-05 08:19:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 136 transitions. [2024-11-05 08:19:32,568 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 136 transitions. Word has length 76 [2024-11-05 08:19:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:32,569 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 136 transitions. [2024-11-05 08:19:32,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-05 08:19:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 136 transitions. [2024-11-05 08:19:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-05 08:19:32,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:32,570 INFO L215 NwaCegarLoop]: trace histogram [16, 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] [2024-11-05 08:19:32,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-05 08:19:32,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:32,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:32,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:32,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1022840801, now seen corresponding path program 1 times [2024-11-05 08:19:32,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:32,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584768532] [2024-11-05 08:19:32,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:32,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:32,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:32,777 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:32,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-05 08:19:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:33,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-05 08:19:33,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:33,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-05 08:19:33,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:33,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-05 08:19:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-05 08:19:34,364 INFO L311 TraceCheckSpWp]: Computing backward predicates...