./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 9bd2c7ff
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:38:15,602 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:38:15,718 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-19 07:38:15,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:38:15,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:38:15,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:38:15,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:38:15,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:38:15,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:38:15,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:38:15,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:38:15,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:38:15,781 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:38:15,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:38:15,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:38:15,783 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:38:15,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:38:15,784 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:38:15,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:38:15,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:38:15,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:38:15,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:38:15,786 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:38:15,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:38:15,787 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:38:15,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:38:15,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:38:15,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:38:15,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:38:15,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:38:15,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:38:15,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:38:15,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:38:15,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:38:15,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:38:15,792 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:38:15,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:38:15,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:38:15,793 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:38:15,793 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6
[2023-11-19 07:38:16,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:38:16,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:38:16,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:38:16,094 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:38:16,095 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:38:16,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i
[2023-11-19 07:38:19,322 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:38:19,549 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:38:19,550 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i
[2023-11-19 07:38:19,561 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/data/a3ce8e743/d7bf656bcb864ce9bb930107160d97ff/FLAGa4934d68a
[2023-11-19 07:38:19,574 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/data/a3ce8e743/d7bf656bcb864ce9bb930107160d97ff
[2023-11-19 07:38:19,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:38:19,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:38:19,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:38:19,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:38:19,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:38:19,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6886ec2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19, skipping insertion in model container
[2023-11-19 07:38:19,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,614 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:38:19,773 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928]
[2023-11-19 07:38:19,802 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:38:19,814 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:38:19,826 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928]
[2023-11-19 07:38:19,840 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:38:19,857 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:38:19,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19 WrapperNode
[2023-11-19 07:38:19,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:38:19,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:38:19,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:38:19,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:38:19,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,901 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113
[2023-11-19 07:38:19,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:38:19,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:38:19,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:38:19,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:38:19,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:38:19,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:38:19,933 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:38:19,933 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:38:19,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19" (1/1) ...
[2023-11-19 07:38:19,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:38:19,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:38:19,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 07:38:20,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 07:38:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:38:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2023-11-19 07:38:20,013 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2023-11-19 07:38:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:38:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:38:20,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:38:20,084 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:38:20,086 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:38:20,310 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:38:20,318 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:38:20,319 INFO L302 CfgBuilder]: Removed 1 assume(true) statements.
[2023-11-19 07:38:20,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:20 BoogieIcfgContainer
[2023-11-19 07:38:20,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:38:20,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:38:20,326 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:38:20,330 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:38:20,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:38:19" (1/3) ...
[2023-11-19 07:38:20,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79babaea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:20, skipping insertion in model container
[2023-11-19 07:38:20,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:19" (2/3) ...
[2023-11-19 07:38:20,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79babaea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:20, skipping insertion in model container
[2023-11-19 07:38:20,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:20" (3/3) ...
[2023-11-19 07:38:20,334 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i
[2023-11-19 07:38:20,351 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:38:20,351 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-19 07:38:20,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:38:20,414 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@320e5a6f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:38:20,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-19 07:38:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2023-11-19 07:38:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2023-11-19 07:38:20,431 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:20,432 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:20,433 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:20,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash 817351995, now seen corresponding path program 1 times
[2023-11-19 07:38:20,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:20,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355979115]
[2023-11-19 07:38:20,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:20,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2023-11-19 07:38:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:38:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2023-11-19 07:38:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2023-11-19 07:38:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2023-11-19 07:38:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2023-11-19 07:38:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2023-11-19 07:38:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2023-11-19 07:38:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2023-11-19 07:38:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2023-11-19 07:38:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2023-11-19 07:38:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2023-11-19 07:38:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:20,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:20,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355979115]
[2023-11-19 07:38:20,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355979115] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:20,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:20,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:38:20,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366306374]
[2023-11-19 07:38:20,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:20,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-19 07:38:20,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:20,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-19 07:38:20,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-19 07:38:20,991 INFO L87 Difference]: Start difference. First operand has 49 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12)
[2023-11-19 07:38:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:21,023 INFO L93 Difference]: Finished difference Result 91 states and 150 transitions.
[2023-11-19 07:38:21,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-19 07:38:21,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81
[2023-11-19 07:38:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:21,042 INFO L225 Difference]: With dead ends: 91
[2023-11-19 07:38:21,042 INFO L226 Difference]: Without dead ends: 45
[2023-11-19 07:38:21,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-19 07:38:21,056 INFO L413 NwaCegarLoop]: 63 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, 63 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
[2023-11-19 07:38:21,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:38:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2023-11-19 07:38:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2023-11-19 07:38:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2023-11-19 07:38:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions.
[2023-11-19 07:38:21,133 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 81
[2023-11-19 07:38:21,135 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:21,136 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions.
[2023-11-19 07:38:21,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12)
[2023-11-19 07:38:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions.
[2023-11-19 07:38:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2023-11-19 07:38:21,145 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:21,146 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:21,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:38:21,147 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:21,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash -94067397, now seen corresponding path program 1 times
[2023-11-19 07:38:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:21,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355980192]
[2023-11-19 07:38:21,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:21,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2023-11-19 07:38:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:38:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2023-11-19 07:38:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2023-11-19 07:38:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2023-11-19 07:38:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2023-11-19 07:38:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2023-11-19 07:38:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2023-11-19 07:38:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2023-11-19 07:38:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2023-11-19 07:38:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2023-11-19 07:38:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2023-11-19 07:38:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,283 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:22,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:22,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355980192]
[2023-11-19 07:38:22,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355980192] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:22,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:22,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:38:22,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530435680]
[2023-11-19 07:38:22,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:22,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:38:22,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:22,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:38:22,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:38:22,291 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:22,590 INFO L93 Difference]: Finished difference Result 106 states and 148 transitions.
[2023-11-19 07:38:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:38:22,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81
[2023-11-19 07:38:22,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:22,596 INFO L225 Difference]: With dead ends: 106
[2023-11-19 07:38:22,596 INFO L226 Difference]: Without dead ends: 64
[2023-11-19 07:38:22,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:38:22,606 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 31 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:22,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 138 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2023-11-19 07:38:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2023-11-19 07:38:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52.
[2023-11-19 07:38:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2023-11-19 07:38:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions.
[2023-11-19 07:38:22,629 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 81
[2023-11-19 07:38:22,630 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:22,631 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions.
[2023-11-19 07:38:22,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions.
[2023-11-19 07:38:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2023-11-19 07:38:22,641 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:22,641 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:22,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:38:22,642 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:22,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash -487094407, now seen corresponding path program 1 times
[2023-11-19 07:38:22,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:22,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894650131]
[2023-11-19 07:38:22,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:22,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2023-11-19 07:38:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:38:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2023-11-19 07:38:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2023-11-19 07:38:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2023-11-19 07:38:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2023-11-19 07:38:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2023-11-19 07:38:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2023-11-19 07:38:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2023-11-19 07:38:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2023-11-19 07:38:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2023-11-19 07:38:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2023-11-19 07:38:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:22,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:22,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894650131]
[2023-11-19 07:38:22,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894650131] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:22,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:22,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:38:22,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806102475]
[2023-11-19 07:38:22,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:22,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:38:22,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:22,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:38:22,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:38:22,926 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:22,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:22,979 INFO L93 Difference]: Finished difference Result 143 states and 203 transitions.
[2023-11-19 07:38:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:38:22,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81
[2023-11-19 07:38:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:22,984 INFO L225 Difference]: With dead ends: 143
[2023-11-19 07:38:22,984 INFO L226 Difference]: Without dead ends: 94
[2023-11-19 07:38:22,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:38:22,987 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 33 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:22,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 122 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:38:22,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2023-11-19 07:38:23,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92.
[2023-11-19 07:38:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 65 states have internal predecessors, (80), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2023-11-19 07:38:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions.
[2023-11-19 07:38:23,010 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 81
[2023-11-19 07:38:23,011 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:23,012 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions.
[2023-11-19 07:38:23,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions.
[2023-11-19 07:38:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2023-11-19 07:38:23,014 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:23,015 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:23,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:38:23,015 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:23,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash -408172682, now seen corresponding path program 1 times
[2023-11-19 07:38:23,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:23,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822271952]
[2023-11-19 07:38:23,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2023-11-19 07:38:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:38:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2023-11-19 07:38:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2023-11-19 07:38:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2023-11-19 07:38:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2023-11-19 07:38:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2023-11-19 07:38:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2023-11-19 07:38:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2023-11-19 07:38:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2023-11-19 07:38:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2023-11-19 07:38:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2023-11-19 07:38:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:24,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:24,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822271952]
[2023-11-19 07:38:24,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822271952] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:24,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:24,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2023-11-19 07:38:24,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669508447]
[2023-11-19 07:38:24,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:24,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-11-19 07:38:24,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-11-19 07:38:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2023-11-19 07:38:24,379 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:25,853 INFO L93 Difference]: Finished difference Result 171 states and 236 transitions.
[2023-11-19 07:38:25,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2023-11-19 07:38:25,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83
[2023-11-19 07:38:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:25,856 INFO L225 Difference]: With dead ends: 171
[2023-11-19 07:38:25,856 INFO L226 Difference]: Without dead ends: 169
[2023-11-19 07:38:25,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420
[2023-11-19 07:38:25,858 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 161 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:25,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 461 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2023-11-19 07:38:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2023-11-19 07:38:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 124.
[2023-11-19 07:38:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 91 states have internal predecessors, (111), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30)
[2023-11-19 07:38:25,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions.
[2023-11-19 07:38:25,895 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 83
[2023-11-19 07:38:25,896 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:25,896 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions.
[2023-11-19 07:38:25,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions.
[2023-11-19 07:38:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2023-11-19 07:38:25,898 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:25,898 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:25,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 07:38:25,899 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:25,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash 271885688, now seen corresponding path program 1 times
[2023-11-19 07:38:25,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:25,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023857506]
[2023-11-19 07:38:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:25,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2023-11-19 07:38:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:38:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2023-11-19 07:38:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2023-11-19 07:38:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2023-11-19 07:38:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2023-11-19 07:38:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2023-11-19 07:38:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2023-11-19 07:38:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2023-11-19 07:38:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2023-11-19 07:38:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2023-11-19 07:38:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2023-11-19 07:38:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:26,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:26,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023857506]
[2023-11-19 07:38:26,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023857506] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:26,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:26,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2023-11-19 07:38:26,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029780115]
[2023-11-19 07:38:26,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:26,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-11-19 07:38:26,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:26,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-11-19 07:38:26,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2023-11-19 07:38:26,856 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:28,592 INFO L93 Difference]: Finished difference Result 202 states and 275 transitions.
[2023-11-19 07:38:28,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2023-11-19 07:38:28,593 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83
[2023-11-19 07:38:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:28,597 INFO L225 Difference]: With dead ends: 202
[2023-11-19 07:38:28,597 INFO L226 Difference]: Without dead ends: 200
[2023-11-19 07:38:28,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552
[2023-11-19 07:38:28,599 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 165 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:28,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 639 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2023-11-19 07:38:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states.
[2023-11-19 07:38:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 127.
[2023-11-19 07:38:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 94 states have internal predecessors, (115), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30)
[2023-11-19 07:38:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 175 transitions.
[2023-11-19 07:38:28,641 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 175 transitions. Word has length 83
[2023-11-19 07:38:28,642 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:28,642 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 175 transitions.
[2023-11-19 07:38:28,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 175 transitions.
[2023-11-19 07:38:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2023-11-19 07:38:28,660 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:28,660 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:28,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:38:28,661 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:28,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:28,662 INFO L85 PathProgramCache]: Analyzing trace with hash -305913102, now seen corresponding path program 1 times
[2023-11-19 07:38:28,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:28,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069678741]
[2023-11-19 07:38:28,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:28,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2023-11-19 07:38:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:38:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2023-11-19 07:38:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2023-11-19 07:38:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2023-11-19 07:38:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2023-11-19 07:38:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2023-11-19 07:38:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2023-11-19 07:38:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2023-11-19 07:38:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2023-11-19 07:38:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2023-11-19 07:38:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2023-11-19 07:38:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:28,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:28,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069678741]
[2023-11-19 07:38:28,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069678741] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:28,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:28,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:38:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718920359]
[2023-11-19 07:38:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:28,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:38:28,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:28,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:38:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:38:28,876 INFO L87 Difference]: Start difference. First operand 127 states and 175 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:28,942 INFO L93 Difference]: Finished difference Result 253 states and 348 transitions.
[2023-11-19 07:38:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:38:28,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83
[2023-11-19 07:38:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:28,946 INFO L225 Difference]: With dead ends: 253
[2023-11-19 07:38:28,946 INFO L226 Difference]: Without dead ends: 129
[2023-11-19 07:38:28,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:38:28,948 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 25 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 196 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
[2023-11-19 07:38:28,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 196 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:38:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2023-11-19 07:38:28,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127.
[2023-11-19 07:38:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 94 states have internal predecessors, (113), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30)
[2023-11-19 07:38:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions.
[2023-11-19 07:38:28,975 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 83
[2023-11-19 07:38:28,976 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:28,976 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions.
[2023-11-19 07:38:28,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:28,977 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions.
[2023-11-19 07:38:28,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2023-11-19 07:38:28,978 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:28,978 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:28,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:38:28,979 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:28,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:28,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1352110223, now seen corresponding path program 1 times
[2023-11-19 07:38:28,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:28,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618969094]
[2023-11-19 07:38:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:28,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2023-11-19 07:38:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:38:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2023-11-19 07:38:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2023-11-19 07:38:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2023-11-19 07:38:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2023-11-19 07:38:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2023-11-19 07:38:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2023-11-19 07:38:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2023-11-19 07:38:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2023-11-19 07:38:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2023-11-19 07:38:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2023-11-19 07:38:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:29,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:29,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618969094]
[2023-11-19 07:38:29,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618969094] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:29,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:29,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:38:29,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853798892]
[2023-11-19 07:38:29,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:29,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:38:29,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:29,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:38:29,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:38:29,057 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:29,117 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions.
[2023-11-19 07:38:29,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:38:29,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84
[2023-11-19 07:38:29,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:29,120 INFO L225 Difference]: With dead ends: 266
[2023-11-19 07:38:29,121 INFO L226 Difference]: Without dead ends: 182
[2023-11-19 07:38:29,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:38:29,123 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 46 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:29,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 147 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:38:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states.
[2023-11-19 07:38:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 177.
[2023-11-19 07:38:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 123 states have (on average 1.170731707317073) internal successors, (144), 125 states have internal predecessors, (144), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48)
[2023-11-19 07:38:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 240 transitions.
[2023-11-19 07:38:29,166 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 240 transitions. Word has length 84
[2023-11-19 07:38:29,166 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:29,166 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 240 transitions.
[2023-11-19 07:38:29,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions.
[2023-11-19 07:38:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2023-11-19 07:38:29,168 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:29,168 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:29,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:38:29,169 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:29,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2028573053, now seen corresponding path program 1 times
[2023-11-19 07:38:29,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:29,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649468817]
[2023-11-19 07:38:29,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:29,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2023-11-19 07:38:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:38:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2023-11-19 07:38:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2023-11-19 07:38:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2023-11-19 07:38:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2023-11-19 07:38:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2023-11-19 07:38:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2023-11-19 07:38:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2023-11-19 07:38:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2023-11-19 07:38:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2023-11-19 07:38:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2023-11-19 07:38:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:29,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649468817]
[2023-11-19 07:38:29,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649468817] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:29,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:29,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:38:29,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710585040]
[2023-11-19 07:38:29,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:29,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:38:29,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:29,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:38:29,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:38:29,246 INFO L87 Difference]: Start difference. First operand 177 states and 240 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:29,302 INFO L93 Difference]: Finished difference Result 309 states and 419 transitions.
[2023-11-19 07:38:29,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:38:29,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84
[2023-11-19 07:38:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:29,305 INFO L225 Difference]: With dead ends: 309
[2023-11-19 07:38:29,305 INFO L226 Difference]: Without dead ends: 175
[2023-11-19 07:38:29,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:38:29,307 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 53 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:29,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 111 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:38:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states.
[2023-11-19 07:38:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173.
[2023-11-19 07:38:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 121 states have internal predecessors, (136), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48)
[2023-11-19 07:38:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 232 transitions.
[2023-11-19 07:38:29,349 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 232 transitions. Word has length 84
[2023-11-19 07:38:29,350 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:29,350 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 232 transitions.
[2023-11-19 07:38:29,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 232 transitions.
[2023-11-19 07:38:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2023-11-19 07:38:29,352 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:29,352 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:29,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 07:38:29,352 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:29,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:29,353 INFO L85 PathProgramCache]: Analyzing trace with hash -25156310, now seen corresponding path program 1 times
[2023-11-19 07:38:29,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:29,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382895932]
[2023-11-19 07:38:29,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:29,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2023-11-19 07:38:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:38:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2023-11-19 07:38:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2023-11-19 07:38:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2023-11-19 07:38:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2023-11-19 07:38:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2023-11-19 07:38:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2023-11-19 07:38:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2023-11-19 07:38:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2023-11-19 07:38:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2023-11-19 07:38:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2023-11-19 07:38:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:29,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:29,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382895932]
[2023-11-19 07:38:29,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382895932] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:29,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:29,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-19 07:38:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369111725]
[2023-11-19 07:38:29,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:29,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:38:29,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:38:29,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:38:29,558 INFO L87 Difference]: Start difference. First operand 173 states and 232 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:29,730 INFO L93 Difference]: Finished difference Result 353 states and 471 transitions.
[2023-11-19 07:38:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-19 07:38:29,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85
[2023-11-19 07:38:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:29,734 INFO L225 Difference]: With dead ends: 353
[2023-11-19 07:38:29,734 INFO L226 Difference]: Without dead ends: 351
[2023-11-19 07:38:29,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2023-11-19 07:38:29,736 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 57 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:29,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 477 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-11-19 07:38:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states.
[2023-11-19 07:38:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 298.
[2023-11-19 07:38:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 203 states have (on average 1.0935960591133005) internal successors, (222), 210 states have internal predecessors, (222), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84)
[2023-11-19 07:38:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 390 transitions.
[2023-11-19 07:38:29,812 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 390 transitions. Word has length 85
[2023-11-19 07:38:29,813 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:29,813 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 390 transitions.
[2023-11-19 07:38:29,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 390 transitions.
[2023-11-19 07:38:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2023-11-19 07:38:29,815 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:29,815 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:29,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 07:38:29,816 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:29,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash -418183320, now seen corresponding path program 1 times
[2023-11-19 07:38:29,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:29,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555014193]
[2023-11-19 07:38:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:29,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2023-11-19 07:38:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:38:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2023-11-19 07:38:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2023-11-19 07:38:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2023-11-19 07:38:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2023-11-19 07:38:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2023-11-19 07:38:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2023-11-19 07:38:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2023-11-19 07:38:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2023-11-19 07:38:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2023-11-19 07:38:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2023-11-19 07:38:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:30,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:30,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555014193]
[2023-11-19 07:38:30,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555014193] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:30,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:30,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2023-11-19 07:38:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640544555]
[2023-11-19 07:38:30,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:30,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-11-19 07:38:30,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:30,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-11-19 07:38:30,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2023-11-19 07:38:30,860 INFO L87 Difference]: Start difference. First operand 298 states and 390 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:32,421 INFO L93 Difference]: Finished difference Result 620 states and 816 transitions.
[2023-11-19 07:38:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2023-11-19 07:38:32,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85
[2023-11-19 07:38:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:32,426 INFO L225 Difference]: With dead ends: 620
[2023-11-19 07:38:32,426 INFO L226 Difference]: Without dead ends: 392
[2023-11-19 07:38:32,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600
[2023-11-19 07:38:32,428 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 127 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:32,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 710 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2023-11-19 07:38:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2023-11-19 07:38:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 307.
[2023-11-19 07:38:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 212 states have (on average 1.0943396226415094) internal successors, (232), 219 states have internal predecessors, (232), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84)
[2023-11-19 07:38:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 400 transitions.
[2023-11-19 07:38:32,552 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 400 transitions. Word has length 85
[2023-11-19 07:38:32,552 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:32,553 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 400 transitions.
[2023-11-19 07:38:32,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 400 transitions.
[2023-11-19 07:38:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2023-11-19 07:38:32,554 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:32,554 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:32,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-19 07:38:32,555 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:32,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash 843534070, now seen corresponding path program 1 times
[2023-11-19 07:38:32,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:32,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916525355]
[2023-11-19 07:38:32,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:32,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2023-11-19 07:38:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:38:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2023-11-19 07:38:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2023-11-19 07:38:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2023-11-19 07:38:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2023-11-19 07:38:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2023-11-19 07:38:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2023-11-19 07:38:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2023-11-19 07:38:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2023-11-19 07:38:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2023-11-19 07:38:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2023-11-19 07:38:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:32,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:38:32,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916525355]
[2023-11-19 07:38:32,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916525355] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:32,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:32,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:38:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417274833]
[2023-11-19 07:38:32,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:32,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:38:32,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:38:32,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:38:32,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:38:32,630 INFO L87 Difference]: Start difference. First operand 307 states and 400 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:32,752 INFO L93 Difference]: Finished difference Result 648 states and 847 transitions.
[2023-11-19 07:38:32,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:38:32,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86
[2023-11-19 07:38:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:32,758 INFO L225 Difference]: With dead ends: 648
[2023-11-19 07:38:32,758 INFO L226 Difference]: Without dead ends: 411
[2023-11-19 07:38:32,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:38:32,760 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:32,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 106 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:38:32,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states.
[2023-11-19 07:38:32,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 342.
[2023-11-19 07:38:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 233 states have (on average 1.0815450643776825) internal successors, (252), 242 states have internal predecessors, (252), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 87 states have call predecessors, (96), 96 states have call successors, (96)
[2023-11-19 07:38:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 444 transitions.
[2023-11-19 07:38:32,881 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 444 transitions. Word has length 86
[2023-11-19 07:38:32,881 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:32,881 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 444 transitions.
[2023-11-19 07:38:32,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 444 transitions.
[2023-11-19 07:38:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2023-11-19 07:38:32,883 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:32,883 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:32,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-19 07:38:32,884 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:32,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2093744938, now seen corresponding path program 1 times
[2023-11-19 07:38:32,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:38:32,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327133651]
[2023-11-19 07:38:32,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:32,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:38:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:38:32,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:38:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:38:32,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:38:32,986 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:38:32,987 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-11-19 07:38:32,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-19 07:38:32,993 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:32,996 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:38:33,068 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
[2023-11-19 07:38:33,072 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short12 could not be translated
[2023-11-19 07:38:33,075 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short12 could not be translated
[2023-11-19 07:38:33,077 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated
[2023-11-19 07:38:33,078 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short12 could not be translated
[2023-11-19 07:38:33,079 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated
[2023-11-19 07:38:33,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:38:33 BoogieIcfgContainer
[2023-11-19 07:38:33,100 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:38:33,102 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:38:33,102 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:38:33,102 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:38:33,103 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:20" (3/4) ...
[2023-11-19 07:38:33,105 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2023-11-19 07:38:33,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:38:33,106 INFO L158 Benchmark]: Toolchain (without parser) took 13527.50ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 151.1MB in the beginning and 95.6MB in the end (delta: 55.5MB). Peak memory consumption was 144.4MB. Max. memory is 16.1GB.
[2023-11-19 07:38:33,107 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:38:33,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.36ms. Allocated memory is still 192.9MB. Free memory was 150.7MB in the beginning and 139.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2023-11-19 07:38:33,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.41ms. Allocated memory is still 192.9MB. Free memory was 139.4MB in the beginning and 137.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:38:33,108 INFO L158 Benchmark]: Boogie Preprocessor took 29.08ms. Allocated memory is still 192.9MB. Free memory was 137.3MB in the beginning and 135.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:38:33,109 INFO L158 Benchmark]: RCFGBuilder took 390.55ms. Allocated memory is still 192.9MB. Free memory was 135.9MB in the beginning and 122.2MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2023-11-19 07:38:33,110 INFO L158 Benchmark]: TraceAbstraction took 12774.31ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 121.4MB in the beginning and 95.6MB in the end (delta: 25.8MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB.
[2023-11-19 07:38:33,110 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 281.0MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:38:33,113 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 277.36ms. Allocated memory is still 192.9MB. Free memory was 150.7MB in the beginning and 139.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 43.41ms. Allocated memory is still 192.9MB. Free memory was 139.4MB in the beginning and 137.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 29.08ms. Allocated memory is still 192.9MB. Free memory was 137.3MB in the beginning and 135.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 390.55ms. Allocated memory is still 192.9MB. Free memory was 135.9MB in the beginning and 122.2MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 12774.31ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 121.4MB in the beginning and 95.6MB in the end (delta: 25.8MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB.
* Witness Printer took 4.14ms. Allocated memory is still 281.0MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~short12 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~short12 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~short12 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of bitwiseOr at line 64.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] signed char var_1_1 = 1;
[L23] unsigned char var_1_2 = 1;
[L24] unsigned char var_1_3 = 1;
[L25] unsigned char var_1_4 = 0;
[L26] signed char var_1_5 = 4;
[L27] signed char var_1_6 = -5;
[L28] signed char var_1_7 = 2;
[L29] signed char var_1_8 = -32;
VAL [isInitial=0, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L68] isInitial = 1
[L69] FCALL initially()
[L70] COND TRUE 1
[L71] FCALL updateLastVariables()
[L72] CALL updateVariables()
[L42] var_1_2 = __VERIFIER_nondet_uchar()
[L43] CALL assume_abort_if_not(var_1_2 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L43] RET assume_abort_if_not(var_1_2 >= 0)
VAL [isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L44] CALL assume_abort_if_not(var_1_2 <= 1)
VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L44] RET assume_abort_if_not(var_1_2 <= 1)
VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L45] var_1_3 = __VERIFIER_nondet_uchar()
[L46] CALL assume_abort_if_not(var_1_3 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L46] RET assume_abort_if_not(var_1_3 >= 0)
VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L47] CALL assume_abort_if_not(var_1_3 <= 1)
VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L47] RET assume_abort_if_not(var_1_3 <= 1)
VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L48] var_1_4 = __VERIFIER_nondet_uchar()
[L49] CALL assume_abort_if_not(var_1_4 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L49] RET assume_abort_if_not(var_1_4 >= 0)
VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L50] CALL assume_abort_if_not(var_1_4 <= 1)
VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L50] RET assume_abort_if_not(var_1_4 <= 1)
VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L51] var_1_5 = __VERIFIER_nondet_char()
[L52] CALL assume_abort_if_not(var_1_5 >= -63)
VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L52] RET assume_abort_if_not(var_1_5 >= -63)
VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L53] CALL assume_abort_if_not(var_1_5 <= 63)
VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L53] RET assume_abort_if_not(var_1_5 <= 63)
VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=-5, var_1_7=2, var_1_8=-32]
[L54] var_1_6 = __VERIFIER_nondet_char()
[L55] CALL assume_abort_if_not(var_1_6 >= -63)
VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=2, var_1_8=-32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=2, var_1_8=-32]
[L55] RET assume_abort_if_not(var_1_6 >= -63)
VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=2, var_1_8=-32]
[L56] CALL assume_abort_if_not(var_1_6 <= 63)
VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=2, var_1_8=-32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=2, var_1_8=-32]
[L56] RET assume_abort_if_not(var_1_6 <= 63)
VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=2, var_1_8=-32]
[L57] var_1_7 = __VERIFIER_nondet_char()
[L58] CALL assume_abort_if_not(var_1_7 >= -127)
VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L58] RET assume_abort_if_not(var_1_7 >= -127)
VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L59] CALL assume_abort_if_not(var_1_7 <= 126)
VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L59] RET assume_abort_if_not(var_1_7 <= 126)
VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L72] RET updateVariables()
[L73] CALL step()
[L33] COND TRUE (var_1_2 || var_1_3) && var_1_4
[L34] var_1_1 = (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7)))
VAL [isInitial=1, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L36] signed char stepLocal_0 = var_1_5;
VAL [isInitial=1, stepLocal_0=-2, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L37] EXPR (-100 + var_1_1) ^ var_1_1
VAL [isInitial=1, stepLocal_0=-2, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L37] COND FALSE !(stepLocal_0 > ((-100 + var_1_1) ^ var_1_1))
[L73] RET step()
[L74] CALL, EXPR property()
[L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1)
VAL [isInitial=1, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L64] EXPR (-100 + var_1_1) ^ var_1_1
VAL [isInitial=1, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1)
VAL [isInitial=1, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L64-L65] return (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1)
;
[L74] RET, EXPR property()
[L74] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
[L19] reach_error()
VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 776 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 748 mSDsluCounter, 3170 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2310 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1555 IncrementalHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 860 mSDtfsCounter, 1555 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=11, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 348 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1003 NumberOfCodeBlocks, 1003 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 905 ConstructedInterpolants, 0 QuantifiedInterpolants, 3590 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2904/2904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-11-19 07:38:33,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:38:35,979 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:38:36,112 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2023-11-19 07:38:36,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:38:36,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:38:36,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:38:36,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:38:36,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:38:36,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:38:36,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:38:36,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:38:36,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:38:36,195 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:38:36,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:38:36,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:38:36,199 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:38:36,199 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:38:36,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:38:36,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:38:36,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:38:36,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:38:36,203 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-11-19 07:38:36,203 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2023-11-19 07:38:36,204 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2023-11-19 07:38:36,204 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:38:36,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:38:36,205 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:38:36,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:38:36,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:38:36,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:38:36,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:38:36,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:38:36,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:38:36,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:38:36,209 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2023-11-19 07:38:36,210 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-11-19 07:38:36,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:38:36,210 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:38:36,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:38:36,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:38:36,212 INFO L153 SettingsManager]: * Logic for external solver=AUFBV
[2023-11-19 07:38:36,213 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:38:36,213 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6
[2023-11-19 07:38:36,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:38:36,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:38:36,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:38:36,666 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:38:36,666 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:38:36,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i
[2023-11-19 07:38:39,988 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:38:40,290 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:38:40,291 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i
[2023-11-19 07:38:40,300 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/data/f20cbe1f8/0766cfa2ab0b46bd8f00177a75bf1b3d/FLAGa97c87ebf
[2023-11-19 07:38:40,320 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/data/f20cbe1f8/0766cfa2ab0b46bd8f00177a75bf1b3d
[2023-11-19 07:38:40,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:38:40,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:38:40,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:38:40,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:38:40,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:38:40,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a283317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40, skipping insertion in model container
[2023-11-19 07:38:40,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,366 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:38:40,566 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928]
[2023-11-19 07:38:40,621 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:38:40,641 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:38:40,661 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928]
[2023-11-19 07:38:40,682 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:38:40,704 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:38:40,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40 WrapperNode
[2023-11-19 07:38:40,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:38:40,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:38:40,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:38:40,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:38:40,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,773 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77
[2023-11-19 07:38:40,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:38:40,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:38:40,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:38:40,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:38:40,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:38:40,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:38:40,841 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:38:40,841 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:38:40,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40" (1/1) ...
[2023-11-19 07:38:40,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:38:40,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:38:40,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 07:38:40,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 07:38:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:38:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2023-11-19 07:38:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2023-11-19 07:38:40,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2023-11-19 07:38:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:38:40,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:38:41,043 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:38:41,045 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:38:41,293 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:38:41,301 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:38:41,301 INFO L302 CfgBuilder]: Removed 1 assume(true) statements.
[2023-11-19 07:38:41,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:41 BoogieIcfgContainer
[2023-11-19 07:38:41,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:38:41,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:38:41,308 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:38:41,311 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:38:41,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:38:40" (1/3) ...
[2023-11-19 07:38:41,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dba145a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:41, skipping insertion in model container
[2023-11-19 07:38:41,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:40" (2/3) ...
[2023-11-19 07:38:41,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dba145a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:41, skipping insertion in model container
[2023-11-19 07:38:41,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:41" (3/3) ...
[2023-11-19 07:38:41,314 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i
[2023-11-19 07:38:41,333 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:38:41,333 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-19 07:38:41,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:38:41,388 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@50c0f736, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:38:41,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-19 07:38:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2023-11-19 07:38:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2023-11-19 07:38:41,404 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:41,405 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:41,405 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:41,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:41,411 INFO L85 PathProgramCache]: Analyzing trace with hash 971633535, now seen corresponding path program 1 times
[2023-11-19 07:38:41,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-19 07:38:41,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401521209]
[2023-11-19 07:38:41,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:41,432 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
[2023-11-19 07:38:41,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/mathsat
[2023-11-19 07:38:41,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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)
[2023-11-19 07:38:41,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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
[2023-11-19 07:38:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:41,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-11-19 07:38:41,645 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:38:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked.
[2023-11-19 07:38:41,684 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 07:38:41,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-19 07:38:41,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401521209]
[2023-11-19 07:38:41,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401521209] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:41,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:41,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:38:41,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235536947]
[2023-11-19 07:38:41,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:41,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-19 07:38:41,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-19 07:38:41,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-19 07:38:41,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-19 07:38:41,726 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)
[2023-11-19 07:38:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:41,754 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions.
[2023-11-19 07:38:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-19 07:38:41,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78
[2023-11-19 07:38:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:41,782 INFO L225 Difference]: With dead ends: 73
[2023-11-19 07:38:41,783 INFO L226 Difference]: Without dead ends: 36
[2023-11-19 07:38:41,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-19 07:38:41,790 INFO L413 NwaCegarLoop]: 49 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, 49 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
[2023-11-19 07:38:41,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:38:41,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2023-11-19 07:38:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2023-11-19 07:38:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2023-11-19 07:38:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions.
[2023-11-19 07:38:41,834 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 78
[2023-11-19 07:38:41,835 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:41,835 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions.
[2023-11-19 07:38:41,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)
[2023-11-19 07:38:41,836 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions.
[2023-11-19 07:38:41,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2023-11-19 07:38:41,840 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:41,840 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:41,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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)] Forceful destruction successful, exit code 0
[2023-11-19 07:38:42,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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
[2023-11-19 07:38:42,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:42,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:42,046 INFO L85 PathProgramCache]: Analyzing trace with hash -483648641, now seen corresponding path program 1 times
[2023-11-19 07:38:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-19 07:38:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774140941]
[2023-11-19 07:38:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:42,048 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
[2023-11-19 07:38:42,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/mathsat
[2023-11-19 07:38:42,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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)
[2023-11-19 07:38:42,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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
[2023-11-19 07:38:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:42,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-11-19 07:38:42,189 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:38:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:43,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 07:38:43,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-19 07:38:43,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774140941]
[2023-11-19 07:38:43,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774140941] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:43,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:43,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-19 07:38:43,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856197261]
[2023-11-19 07:38:43,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:43,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:38:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-19 07:38:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:38:43,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:38:43,513 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:44,006 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions.
[2023-11-19 07:38:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-19 07:38:44,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78
[2023-11-19 07:38:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:44,011 INFO L225 Difference]: With dead ends: 97
[2023-11-19 07:38:44,011 INFO L226 Difference]: Without dead ends: 95
[2023-11-19 07:38:44,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2023-11-19 07:38:44,013 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:44,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 270 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2023-11-19 07:38:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2023-11-19 07:38:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59.
[2023-11-19 07:38:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18)
[2023-11-19 07:38:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions.
[2023-11-19 07:38:44,037 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 78
[2023-11-19 07:38:44,037 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:44,038 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions.
[2023-11-19 07:38:44,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions.
[2023-11-19 07:38:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2023-11-19 07:38:44,040 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:44,040 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:44,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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
[2023-11-19 07:38:44,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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
[2023-11-19 07:38:44,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:44,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:44,245 INFO L85 PathProgramCache]: Analyzing trace with hash -481801599, now seen corresponding path program 1 times
[2023-11-19 07:38:44,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-19 07:38:44,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591208008]
[2023-11-19 07:38:44,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:44,246 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
[2023-11-19 07:38:44,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/mathsat
[2023-11-19 07:38:44,247 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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)
[2023-11-19 07:38:44,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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
[2023-11-19 07:38:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:44,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core
[2023-11-19 07:38:44,355 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:38:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 150 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2023-11-19 07:38:46,002 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 07:38:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:47,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-19 07:38:47,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591208008]
[2023-11-19 07:38:47,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591208008] provided 1 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:38:47,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-19 07:38:47,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18
[2023-11-19 07:38:47,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928508625]
[2023-11-19 07:38:47,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:47,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:38:47,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-19 07:38:47,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:38:47,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306
[2023-11-19 07:38:47,353 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:49,420 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions.
[2023-11-19 07:38:49,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2023-11-19 07:38:49,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78
[2023-11-19 07:38:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:49,426 INFO L225 Difference]: With dead ends: 111
[2023-11-19 07:38:49,426 INFO L226 Difference]: Without dead ends: 109
[2023-11-19 07:38:49,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600
[2023-11-19 07:38:49,428 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 75 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:49,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 276 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2023-11-19 07:38:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2023-11-19 07:38:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 56.
[2023-11-19 07:38:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18)
[2023-11-19 07:38:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions.
[2023-11-19 07:38:49,476 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 78
[2023-11-19 07:38:49,478 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:49,479 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions.
[2023-11-19 07:38:49,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions.
[2023-11-19 07:38:49,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2023-11-19 07:38:49,482 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:49,483 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:49,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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)] Forceful destruction successful, exit code 0
[2023-11-19 07:38:49,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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
[2023-11-19 07:38:49,687 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:49,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:49,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1291358721, now seen corresponding path program 1 times
[2023-11-19 07:38:49,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-19 07:38:49,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706780712]
[2023-11-19 07:38:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:49,689 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
[2023-11-19 07:38:49,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/mathsat
[2023-11-19 07:38:49,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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)
[2023-11-19 07:38:49,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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
[2023-11-19 07:38:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:49,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-11-19 07:38:49,789 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:38:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-19 07:38:50,445 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 07:38:50,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-19 07:38:50,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706780712]
[2023-11-19 07:38:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706780712] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:38:50,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:38:50,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-19 07:38:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029866814]
[2023-11-19 07:38:50,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:38:50,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:38:50,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-19 07:38:50,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:38:50,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:38:50,453 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:50,692 INFO L93 Difference]: Finished difference Result 92 states and 126 transitions.
[2023-11-19 07:38:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-19 07:38:50,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78
[2023-11-19 07:38:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:50,696 INFO L225 Difference]: With dead ends: 92
[2023-11-19 07:38:50,696 INFO L226 Difference]: Without dead ends: 90
[2023-11-19 07:38:50,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2023-11-19 07:38:50,698 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 32 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:50,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 364 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2023-11-19 07:38:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2023-11-19 07:38:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59.
[2023-11-19 07:38:50,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18)
[2023-11-19 07:38:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions.
[2023-11-19 07:38:50,733 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 78
[2023-11-19 07:38:50,735 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:50,735 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions.
[2023-11-19 07:38:50,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-19 07:38:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions.
[2023-11-19 07:38:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2023-11-19 07:38:50,742 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:50,742 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:50,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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
[2023-11-19 07:38:50,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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
[2023-11-19 07:38:50,946 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:50,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:50,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1293205763, now seen corresponding path program 1 times
[2023-11-19 07:38:50,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-19 07:38:50,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873292577]
[2023-11-19 07:38:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:50,949 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
[2023-11-19 07:38:50,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/mathsat
[2023-11-19 07:38:50,950 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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)
[2023-11-19 07:38:50,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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
[2023-11-19 07:38:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:51,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-11-19 07:38:51,037 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:38:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2023-11-19 07:38:51,425 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 07:38:51,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-19 07:38:51,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873292577]
[2023-11-19 07:38:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873292577] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:38:51,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [279179331]
[2023-11-19 07:38:51,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:51,730 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2023-11-19 07:38:51,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/cvc4
[2023-11-19 07:38:51,733 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2023-11-19 07:38:51,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process
[2023-11-19 07:38:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:51,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-11-19 07:38:51,892 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:38:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2023-11-19 07:38:52,192 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 07:38:52,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [279179331] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:38:52,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-11-19 07:38:52,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6
[2023-11-19 07:38:52,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383115159]
[2023-11-19 07:38:52,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-11-19 07:38:52,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:38:52,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-19 07:38:52,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:38:52,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2023-11-19 07:38:52,372 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)
[2023-11-19 07:38:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:38:52,763 INFO L93 Difference]: Finished difference Result 168 states and 223 transitions.
[2023-11-19 07:38:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2023-11-19 07:38:52,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78
[2023-11-19 07:38:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:38:52,775 INFO L225 Difference]: With dead ends: 168
[2023-11-19 07:38:52,775 INFO L226 Difference]: Without dead ends: 112
[2023-11-19 07:38:52,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210
[2023-11-19 07:38:52,778 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 25 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2023-11-19 07:38:52,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 178 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2023-11-19 07:38:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2023-11-19 07:38:52,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108.
[2023-11-19 07:38:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 68 states have internal predecessors, (71), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36)
[2023-11-19 07:38:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 143 transitions.
[2023-11-19 07:38:52,816 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 143 transitions. Word has length 78
[2023-11-19 07:38:52,817 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:38:52,817 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 143 transitions.
[2023-11-19 07:38:52,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)
[2023-11-19 07:38:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 143 transitions.
[2023-11-19 07:38:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2023-11-19 07:38:52,821 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:38:52,821 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:38:52,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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)] Forceful destruction successful, exit code 0
[2023-11-19 07:38:53,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0
[2023-11-19 07:38:53,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/cvc4 --incremental --print-success --lang smt
[2023-11-19 07:38:53,226 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:38:53,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:38:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash 287456292, now seen corresponding path program 1 times
[2023-11-19 07:38:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-19 07:38:53,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31742016]
[2023-11-19 07:38:53,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:38:53,228 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
[2023-11-19 07:38:53,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/mathsat
[2023-11-19 07:38:53,230 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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)
[2023-11-19 07:38:53,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1045e35-5f8c-4be9-bc1e-438ef74da21b/bin/uautomizer-verify-uCwYo4JHxu/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
[2023-11-19 07:38:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:38:53,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjunts are in the unsatisfiable core
[2023-11-19 07:38:53,394 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:38:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 729 proven. 196 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked.
[2023-11-19 07:38:57,943 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 07:39:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked.
[2023-11-19 07:39:00,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-19 07:39:00,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31742016]
[2023-11-19 07:39:00,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31742016] provided 1 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:39:00,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-19 07:39:00,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23
[2023-11-19 07:39:00,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658528249]
[2023-11-19 07:39:00,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:39:00,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:39:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-19 07:39:00,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:39:00,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506
[2023-11-19 07:39:00,385 INFO L87 Difference]: Start difference. First operand 108 states and 143 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)