./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a0165632
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_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX --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 d4fe8f11f0c68d7bafb86f3d9a757ae2e080a2c1f07f1d7545768deda82695bc
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:43:29,549 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:43:29,699 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 18:43:29,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:43:29,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:43:29,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:43:29,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:43:29,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:43:29,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:43:29,759 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:43:29,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:43:29,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:43:29,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:43:29,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:43:29,762 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:43:29,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:43:29,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:43:29,763 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:43:29,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 18:43:29,765 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:43:29,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:43:29,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:43:29,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:43:29,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:43:29,767 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:43:29,768 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:43:29,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:43:29,768 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:43:29,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:43:29,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:43:29,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:43:29,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:43:29,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:43:29,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:43:29,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:43:29,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:43:29,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 18:43:29,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 18:43:29,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:43:29,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:43:29,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:43:29,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:43:29,776 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_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/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_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX
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 -> d4fe8f11f0c68d7bafb86f3d9a757ae2e080a2c1f07f1d7545768deda82695bc
[2024-11-08 18:43:30,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:43:30,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:43:30,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:43:30,192 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:43:30,192 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:43:30,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i
Unable to find full path for "g++"
[2024-11-08 18:43:32,507 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:43:32,816 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:43:32,817 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i
[2024-11-08 18:43:32,828 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/data/06a050b91/87d0be5985f04d4b82b9eb08fffb5846/FLAG924f35f49
[2024-11-08 18:43:32,844 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/data/06a050b91/87d0be5985f04d4b82b9eb08fffb5846
[2024-11-08 18:43:32,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:43:32,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:43:32,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:43:32,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:43:32,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:43:32,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:43:32" (1/1) ...
[2024-11-08 18:43:32,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69af723f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:32, skipping insertion in model container
[2024-11-08 18:43:32,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:43:32" (1/1) ...
[2024-11-08 18:43:32,900 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:43:33,188 WARN L250 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_226f5a61-7f6a-4906-ad34-a9f5161e92c9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i[915,928]
[2024-11-08 18:43:33,251 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:43:33,265 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:43:33,281 WARN L250 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_226f5a61-7f6a-4906-ad34-a9f5161e92c9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i[915,928]
[2024-11-08 18:43:33,307 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:43:33,331 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:43:33,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33 WrapperNode
[2024-11-08 18:43:33,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:43:33,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:43:33,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:43:33,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:43:33,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (1/1) ...
[2024-11-08 18:43:33,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (1/1) ...
[2024-11-08 18:43:33,388 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130
[2024-11-08 18:43:33,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:43:33,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:43:33,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:43:33,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:43:33,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (1/1) ...
[2024-11-08 18:43:33,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (1/1) ...
[2024-11-08 18:43:33,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (1/1) ...
[2024-11-08 18:43:33,428 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 18:43:33,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (1/1) ...
[2024-11-08 18:43:33,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (1/1) ...
[2024-11-08 18:43:33,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (1/1) ...
[2024-11-08 18:43:33,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (1/1) ...
[2024-11-08 18:43:33,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (1/1) ...
[2024-11-08 18:43:33,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (1/1) ...
[2024-11-08 18:43:33,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:43:33,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:43:33,453 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:43:33,454 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:43:33,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (1/1) ...
[2024-11-08 18:43:33,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:43:33,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:33,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:43:33,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:43:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:43:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 18:43:33,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 18:43:33,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 18:43:33,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:43:33,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:43:33,710 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:43:33,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:43:34,301 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2024-11-08 18:43:34,302 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:43:34,330 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:43:34,330 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 18:43:34,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:43:34 BoogieIcfgContainer
[2024-11-08 18:43:34,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:43:34,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:43:34,339 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:43:34,343 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:43:34,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:43:32" (1/3) ...
[2024-11-08 18:43:34,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ec30f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:43:34, skipping insertion in model container
[2024-11-08 18:43:34,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:33" (2/3) ...
[2024-11-08 18:43:34,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ec30f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:43:34, skipping insertion in model container
[2024-11-08 18:43:34,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:43:34" (3/3) ...
[2024-11-08 18:43:34,349 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-18.i
[2024-11-08 18:43:34,373 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:43:34,374 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 18:43:34,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:43:34,502 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24fa0e52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:43:34,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 18:43:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 18:43:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2024-11-08 18:43:34,530 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:43:34,531 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:34,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:43:34,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:34,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1526359180, now seen corresponding path program 1 times
[2024-11-08 18:43:34,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:34,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424375090]
[2024-11-08 18:43:34,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:34,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:43:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:34,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:43:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:34,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:43:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:34,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:43:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:34,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 18:43:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:34,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:43:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:34,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 18:43:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 18:43:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 18:43:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:34,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 18:43:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:35,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:43:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:35,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:43:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:43:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:35,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:43:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:35,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:43:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:35,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:43:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 18:43:35,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:43:35,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424375090]
[2024-11-08 18:43:35,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424375090] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:35,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:35,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 18:43:35,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532927057]
[2024-11-08 18:43:35,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:35,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 18:43:35,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:43:35,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 18:43:35,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:43:35,114 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-08 18:43:35,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:43:35,165 INFO L93 Difference]: Finished difference Result 115 states and 192 transitions.
[2024-11-08 18:43:35,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 18:43:35,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106
[2024-11-08 18:43:35,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:43:35,181 INFO L225 Difference]: With dead ends: 115
[2024-11-08 18:43:35,181 INFO L226 Difference]: Without dead ends: 57
[2024-11-08 18:43:35,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:43:35,192 INFO L432 NwaCegarLoop]: 84 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, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:43:35,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:43:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2024-11-08 18:43:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2024-11-08 18:43:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 18:43:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions.
[2024-11-08 18:43:35,267 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 106
[2024-11-08 18:43:35,270 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:43:35,270 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions.
[2024-11-08 18:43:35,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-08 18:43:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions.
[2024-11-08 18:43:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2024-11-08 18:43:35,276 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:43:35,276 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:35,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 18:43:35,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:43:35,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash 662536716, now seen corresponding path program 1 times
[2024-11-08 18:43:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502255032]
[2024-11-08 18:43:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:35,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:35,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:43:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:35,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:43:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:43:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:43:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 18:43:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:43:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 18:43:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 18:43:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 18:43:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 18:43:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:43:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:43:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:43:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:43:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:43:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:43:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 18:43:36,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:43:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502255032]
[2024-11-08 18:43:36,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502255032] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:36,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:36,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:43:36,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232593441]
[2024-11-08 18:43:36,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:36,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:43:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:43:36,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:43:36,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:43:36,188 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 18:43:36,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:43:36,549 INFO L93 Difference]: Finished difference Result 166 states and 247 transitions.
[2024-11-08 18:43:36,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:43:36,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106
[2024-11-08 18:43:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:43:36,553 INFO L225 Difference]: With dead ends: 166
[2024-11-08 18:43:36,554 INFO L226 Difference]: Without dead ends: 112
[2024-11-08 18:43:36,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:43:36,556 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 62 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 18:43:36,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 199 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 18:43:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2024-11-08 18:43:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103.
[2024-11-08 18:43:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-08 18:43:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions.
[2024-11-08 18:43:36,586 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 106
[2024-11-08 18:43:36,586 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:43:36,587 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions.
[2024-11-08 18:43:36,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 18:43:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions.
[2024-11-08 18:43:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2024-11-08 18:43:36,590 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:43:36,590 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:36,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 18:43:36,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:43:36,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:36,592 INFO L85 PathProgramCache]: Analyzing trace with hash -317674954, now seen corresponding path program 1 times
[2024-11-08 18:43:36,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:36,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304114126]
[2024-11-08 18:43:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:36,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:43:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:43:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:43:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:43:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 18:43:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:43:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 18:43:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 18:43:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 18:43:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 18:43:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:43:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:43:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:43:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:43:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:43:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:43:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 18:43:37,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:43:37,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304114126]
[2024-11-08 18:43:37,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304114126] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:37,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:37,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 18:43:37,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417804904]
[2024-11-08 18:43:37,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:37,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:43:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:43:37,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:43:37,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:43:37,155 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 18:43:37,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:43:37,286 INFO L93 Difference]: Finished difference Result 188 states and 277 transitions.
[2024-11-08 18:43:37,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:43:37,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110
[2024-11-08 18:43:37,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:43:37,289 INFO L225 Difference]: With dead ends: 188
[2024-11-08 18:43:37,289 INFO L226 Difference]: Without dead ends: 125
[2024-11-08 18:43:37,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:43:37,292 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:43:37,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 169 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 18:43:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2024-11-08 18:43:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101.
[2024-11-08 18:43:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-08 18:43:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions.
[2024-11-08 18:43:37,316 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 110
[2024-11-08 18:43:37,316 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:43:37,316 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions.
[2024-11-08 18:43:37,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 18:43:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions.
[2024-11-08 18:43:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-08 18:43:37,319 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:43:37,319 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:37,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 18:43:37,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:43:37,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:37,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1038092201, now seen corresponding path program 1 times
[2024-11-08 18:43:37,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:37,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639313525]
[2024-11-08 18:43:37,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:37,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:43:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:43:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:43:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:43:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 18:43:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:43:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 18:43:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 18:43:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 18:43:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 18:43:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:43:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 18:43:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:43:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 18:43:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:43:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-08 18:43:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 18:43:38,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:43:38,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639313525]
[2024-11-08 18:43:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639313525] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:38,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:38,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:43:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602624611]
[2024-11-08 18:43:38,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:38,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:43:38,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:43:38,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:43:38,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:43:38,567 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 18:43:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:43:38,878 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions.
[2024-11-08 18:43:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:43:38,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111
[2024-11-08 18:43:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:43:38,881 INFO L225 Difference]: With dead ends: 192
[2024-11-08 18:43:38,881 INFO L226 Difference]: Without dead ends: 125
[2024-11-08 18:43:38,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:43:38,883 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 18:43:38,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 193 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 18:43:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2024-11-08 18:43:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117.
[2024-11-08 18:43:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 82 states have internal predecessors, (105), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-08 18:43:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions.
[2024-11-08 18:43:38,919 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 111
[2024-11-08 18:43:38,920 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:43:38,920 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions.
[2024-11-08 18:43:38,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 18:43:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions.
[2024-11-08 18:43:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-08 18:43:38,923 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:43:38,923 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:38,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 18:43:38,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:43:38,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash -77414563, now seen corresponding path program 1 times
[2024-11-08 18:43:38,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:43:38,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513203797]
[2024-11-08 18:43:38,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:38,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:43:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-08 18:43:39,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687848412]
[2024-11-08 18:43:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:39,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:39,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:39,072 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:43:39,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 18:43:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:43:39,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 18:43:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:43:39,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 18:43:39,366 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 18:43:39,367 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 18:43:39,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 18:43:39,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:43:39,575 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-11-08 18:43:39,729 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:43:39,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:43:39 BoogieIcfgContainer
[2024-11-08 18:43:39,736 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:43:39,737 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:43:39,738 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:43:39,738 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:43:39,738 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:43:34" (3/4) ...
[2024-11-08 18:43:39,742 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 18:43:39,743 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:43:39,748 INFO L158 Benchmark]: Toolchain (without parser) took 6895.02ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 123.1MB in the beginning and 149.2MB in the end (delta: -26.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB.
[2024-11-08 18:43:39,748 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 119.5MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:43:39,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.06ms. Allocated memory is still 155.2MB. Free memory was 122.3MB in the beginning and 115.7MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-08 18:43:39,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.76ms. Allocated memory is still 155.2MB. Free memory was 115.7MB in the beginning and 113.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:43:39,750 INFO L158 Benchmark]: Boogie Preprocessor took 59.63ms. Allocated memory is still 155.2MB. Free memory was 113.6MB in the beginning and 110.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:43:39,750 INFO L158 Benchmark]: RCFGBuilder took 881.22ms. Allocated memory is still 155.2MB. Free memory was 110.7MB in the beginning and 91.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-11-08 18:43:39,755 INFO L158 Benchmark]: TraceAbstraction took 5398.67ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 91.8MB in the beginning and 149.2MB in the end (delta: -57.4MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB.
[2024-11-08 18:43:39,755 INFO L158 Benchmark]: Witness Printer took 5.77ms. Allocated memory is still 186.6MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:43:39,758 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.30ms. Allocated memory is still 119.5MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 481.06ms. Allocated memory is still 155.2MB. Free memory was 122.3MB in the beginning and 115.7MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 55.76ms. Allocated memory is still 155.2MB. Free memory was 115.7MB in the beginning and 113.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 59.63ms. Allocated memory is still 155.2MB. Free memory was 113.6MB in the beginning and 110.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 881.22ms. Allocated memory is still 155.2MB. Free memory was 110.7MB in the beginning and 91.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 5398.67ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 91.8MB in the beginning and 149.2MB in the end (delta: -57.4MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB.
* Witness Printer took 5.77ms. Allocated memory is still 186.6MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB.
* 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 someBinaryFLOATComparisonOperation at line 99, overapproximation of bitwiseOr at line 99.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] float var_1_1 = 99.25;
[L23] signed short int var_1_6 = 32;
[L24] signed short int var_1_7 = 18477;
[L25] signed short int var_1_8 = 5;
[L26] float var_1_9 = 100.8;
[L27] unsigned long int var_1_10 = 256;
[L28] unsigned char var_1_11 = 0;
[L29] unsigned char var_1_12 = 10;
[L30] unsigned long int var_1_13 = 1879106797;
[L31] unsigned long int var_1_14 = 1581421231;
[L32] signed long int var_1_15 = -32;
[L33] unsigned long int last_1_var_1_10 = 256;
[L34] signed long int last_1_var_1_15 = -32;
VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5]
[L103] isInitial = 1
[L104] FCALL initially()
[L105] COND TRUE 1
[L106] CALL updateLastVariables()
[L95] last_1_var_1_10 = var_1_10
[L96] last_1_var_1_15 = var_1_15
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5]
[L106] RET updateLastVariables()
[L107] CALL updateVariables()
[L69] var_1_6 = __VERIFIER_nondet_short()
[L70] CALL assume_abort_if_not(var_1_6 >= -1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=18477, var_1_8=5, var_1_9=504/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=18477, var_1_8=5, var_1_9=504/5]
[L70] RET assume_abort_if_not(var_1_6 >= -1)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=18477, var_1_8=5, var_1_9=504/5]
[L71] CALL assume_abort_if_not(var_1_6 <= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=18477, var_1_8=5, var_1_9=504/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=18477, var_1_8=5, var_1_9=504/5]
[L71] RET assume_abort_if_not(var_1_6 <= 32767)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=18477, var_1_8=5, var_1_9=504/5]
[L72] var_1_7 = __VERIFIER_nondet_short()
[L73] CALL assume_abort_if_not(var_1_7 >= 16383)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=5, var_1_9=504/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=5, var_1_9=504/5]
[L73] RET assume_abort_if_not(var_1_7 >= 16383)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=5, var_1_9=504/5]
[L74] CALL assume_abort_if_not(var_1_7 <= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=5, var_1_9=504/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=5, var_1_9=504/5]
[L74] RET assume_abort_if_not(var_1_7 <= 32767)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=5, var_1_9=504/5]
[L75] var_1_8 = __VERIFIER_nondet_short()
[L76] CALL assume_abort_if_not(var_1_8 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=504/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=504/5]
[L76] RET assume_abort_if_not(var_1_8 >= 0)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=504/5]
[L77] CALL assume_abort_if_not(var_1_8 <= 16383)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=504/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=504/5]
[L77] RET assume_abort_if_not(var_1_8 <= 16383)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=504/5]
[L78] var_1_9 = __VERIFIER_nondet_float()
[L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L80] var_1_11 = __VERIFIER_nondet_uchar()
[L81] CALL assume_abort_if_not(var_1_11 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L81] RET assume_abort_if_not(var_1_11 >= 0)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L82] CALL assume_abort_if_not(var_1_11 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L82] RET assume_abort_if_not(var_1_11 <= 1)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L83] var_1_12 = __VERIFIER_nondet_uchar()
[L84] CALL assume_abort_if_not(var_1_12 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L84] RET assume_abort_if_not(var_1_12 >= 0)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L85] CALL assume_abort_if_not(var_1_12 <= 255)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L85] RET assume_abort_if_not(var_1_12 <= 255)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L86] CALL assume_abort_if_not(var_1_12 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L86] RET assume_abort_if_not(var_1_12 != 0)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L87] var_1_13 = __VERIFIER_nondet_ulong()
[L88] CALL assume_abort_if_not(var_1_13 >= 1073741823)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L88] RET assume_abort_if_not(var_1_13 >= 1073741823)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L89] CALL assume_abort_if_not(var_1_13 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L89] RET assume_abort_if_not(var_1_13 <= 2147483647)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L90] var_1_14 = __VERIFIER_nondet_ulong()
[L91] CALL assume_abort_if_not(var_1_14 >= 1073741824)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L91] RET assume_abort_if_not(var_1_14 >= 1073741824)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L92] CALL assume_abort_if_not(var_1_14 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L92] RET assume_abort_if_not(var_1_14 <= 2147483647)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L107] RET updateVariables()
[L108] CALL step()
[L38] unsigned long int stepLocal_1 = last_1_var_1_10;
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L39] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10)))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0]
[L39] unsigned long int stepLocal_0 = last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10)));
[L40] COND FALSE !(stepLocal_0 != last_1_var_1_10)
[L45] var_1_1 = var_1_9
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2]
[L47] signed short int stepLocal_2 = var_1_6;
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=-1, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2]
[L48] COND FALSE !(\read(var_1_11))
[L55] var_1_10 = var_1_7
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=-1, var_1_10=16383, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2]
[L57] unsigned long int stepLocal_3 = var_1_10;
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=-1, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2]
[L58] COND FALSE !(var_1_1 <= var_1_9)
[L65] var_1_15 = var_1_7
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=-1, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2]
[L108] RET step()
[L109] CALL, EXPR property()
[L99] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10)))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2]
[L99-L100] return ((((last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10)))) != last_1_var_1_10) ? ((last_1_var_1_10 == (var_1_6 - (var_1_7 - var_1_8))) ? (var_1_1 == ((float) var_1_9)) : 1) : (var_1_1 == ((float) var_1_9))) && (var_1_11 ? (((var_1_7 % var_1_12) >= var_1_6) ? (var_1_10 == ((unsigned long int) ((var_1_13 + var_1_14) - var_1_7))) : (var_1_10 == ((unsigned long int) var_1_12))) : (var_1_10 == ((unsigned long int) var_1_7)))) && ((var_1_1 <= var_1_9) ? ((var_1_10 > (last_1_var_1_15 + (var_1_10 + var_1_7))) ? (var_1_15 == ((signed long int) var_1_7)) : (var_1_15 == ((signed long int) -5))) : (var_1_15 == ((signed long int) var_1_7)))
;
[L109] RET, EXPR property()
[L109] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 645 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 356 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 289 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 1167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 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
[2024-11-08 18:43:39,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX --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 d4fe8f11f0c68d7bafb86f3d9a757ae2e080a2c1f07f1d7545768deda82695bc
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:43:42,650 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:43:42,751 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 18:43:42,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:43:42,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:43:42,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:43:42,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:43:42,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:43:42,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:43:42,819 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:43:42,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:43:42,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:43:42,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:43:42,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:43:42,825 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:43:42,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:43:42,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:43:42,826 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:43:42,826 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:43:42,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:43:42,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:43:42,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:43:42,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:43:42,836 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 18:43:42,836 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 18:43:42,837 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:43:42,837 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 18:43:42,837 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:43:42,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:43:42,838 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:43:42,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:43:42,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:43:42,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:43:42,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:43:42,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:43:42,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:43:42,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:43:42,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:43:42,844 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 18:43:42,844 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 18:43:42,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:43:42,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:43:42,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:43:42,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:43:42,857 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_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/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_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX
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 -> d4fe8f11f0c68d7bafb86f3d9a757ae2e080a2c1f07f1d7545768deda82695bc
[2024-11-08 18:43:43,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:43:43,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:43:43,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:43:43,379 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:43:43,379 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:43:43,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i
Unable to find full path for "g++"
[2024-11-08 18:43:46,003 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:43:46,268 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:43:46,268 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i
[2024-11-08 18:43:46,278 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/data/e4901e5f2/5a9fdeba26f2441bad01ea56a96f97d2/FLAG85585be4b
[2024-11-08 18:43:46,595 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/data/e4901e5f2/5a9fdeba26f2441bad01ea56a96f97d2
[2024-11-08 18:43:46,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:43:46,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:43:46,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:43:46,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:43:46,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:43:46,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:43:46" (1/1) ...
[2024-11-08 18:43:46,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67700054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:46, skipping insertion in model container
[2024-11-08 18:43:46,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:43:46" (1/1) ...
[2024-11-08 18:43:46,644 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:43:46,948 WARN L250 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_226f5a61-7f6a-4906-ad34-a9f5161e92c9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i[915,928]
[2024-11-08 18:43:47,019 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:43:47,050 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:43:47,070 WARN L250 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_226f5a61-7f6a-4906-ad34-a9f5161e92c9/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i[915,928]
[2024-11-08 18:43:47,115 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:43:47,152 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:43:47,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47 WrapperNode
[2024-11-08 18:43:47,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:43:47,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:43:47,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:43:47,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:43:47,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (1/1) ...
[2024-11-08 18:43:47,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (1/1) ...
[2024-11-08 18:43:47,229 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106
[2024-11-08 18:43:47,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:43:47,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:43:47,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:43:47,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:43:47,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (1/1) ...
[2024-11-08 18:43:47,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (1/1) ...
[2024-11-08 18:43:47,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (1/1) ...
[2024-11-08 18:43:47,300 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 18:43:47,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (1/1) ...
[2024-11-08 18:43:47,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (1/1) ...
[2024-11-08 18:43:47,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (1/1) ...
[2024-11-08 18:43:47,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (1/1) ...
[2024-11-08 18:43:47,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (1/1) ...
[2024-11-08 18:43:47,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (1/1) ...
[2024-11-08 18:43:47,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:43:47,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:43:47,345 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:43:47,345 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:43:47,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (1/1) ...
[2024-11-08 18:43:47,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:43:47,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:43:47,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:43:47,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:43:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:43:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 18:43:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 18:43:47,437 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 18:43:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:43:47,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:43:47,563 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:43:47,565 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:43:48,018 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2024-11-08 18:43:48,019 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:43:48,035 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:43:48,035 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 18:43:48,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:43:48 BoogieIcfgContainer
[2024-11-08 18:43:48,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:43:48,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:43:48,039 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:43:48,043 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:43:48,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:43:46" (1/3) ...
[2024-11-08 18:43:48,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8eaf54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:43:48, skipping insertion in model container
[2024-11-08 18:43:48,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:43:47" (2/3) ...
[2024-11-08 18:43:48,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8eaf54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:43:48, skipping insertion in model container
[2024-11-08 18:43:48,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:43:48" (3/3) ...
[2024-11-08 18:43:48,047 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-18.i
[2024-11-08 18:43:48,070 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:43:48,070 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 18:43:48,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:43:48,184 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@21068b17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:43:48,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 18:43:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 18:43:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2024-11-08 18:43:48,202 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:43:48,203 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:48,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:43:48,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:48,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1811369050, now seen corresponding path program 1 times
[2024-11-08 18:43:48,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:48,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351698303]
[2024-11-08 18:43:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:48,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:43:48,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:43:48,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:43:48,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-08 18:43:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:48,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:48,595 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:43:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked.
[2024-11-08 18:43:48,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:43:48,651 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:43:48,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351698303]
[2024-11-08 18:43:48,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351698303] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:48,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:48,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 18:43:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651672678]
[2024-11-08 18:43:48,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:48,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 18:43:48,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:43:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 18:43:48,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:43:48,700 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-08 18:43:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:43:48,747 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions.
[2024-11-08 18:43:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 18:43:48,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102
[2024-11-08 18:43:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:43:48,762 INFO L225 Difference]: With dead ends: 95
[2024-11-08 18:43:48,762 INFO L226 Difference]: Without dead ends: 47
[2024-11-08 18:43:48,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:43:48,776 INFO L432 NwaCegarLoop]: 68 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, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:43:48,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:43:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2024-11-08 18:43:48,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2024-11-08 18:43:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-08 18:43:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions.
[2024-11-08 18:43:48,841 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 102
[2024-11-08 18:43:48,843 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:43:48,843 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions.
[2024-11-08 18:43:48,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-08 18:43:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions.
[2024-11-08 18:43:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2024-11-08 18:43:48,853 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:43:48,853 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:48,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/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
[2024-11-08 18:43:49,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:43:49,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:43:49,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:49,057 INFO L85 PathProgramCache]: Analyzing trace with hash -843673306, now seen corresponding path program 1 times
[2024-11-08 18:43:49,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:49,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506415864]
[2024-11-08 18:43:49,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:49,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:43:49,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:43:49,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:43:49,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-08 18:43:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:49,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:49,361 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:43:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 18:43:50,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:43:50,717 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:43:50,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506415864]
[2024-11-08 18:43:50,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506415864] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:43:50,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:43:50,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:43:50,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797370607]
[2024-11-08 18:43:50,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:43:50,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:43:50,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:43:50,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:43:50,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:43:50,728 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 18:43:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:43:51,308 INFO L93 Difference]: Finished difference Result 136 states and 199 transitions.
[2024-11-08 18:43:51,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:43:51,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102
[2024-11-08 18:43:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:43:51,319 INFO L225 Difference]: With dead ends: 136
[2024-11-08 18:43:51,320 INFO L226 Difference]: Without dead ends: 92
[2024-11-08 18:43:51,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:43:51,322 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 18:43:51,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 204 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 18:43:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2024-11-08 18:43:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78.
[2024-11-08 18:43:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-08 18:43:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions.
[2024-11-08 18:43:51,375 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 102
[2024-11-08 18:43:51,376 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:43:51,377 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions.
[2024-11-08 18:43:51,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 18:43:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions.
[2024-11-08 18:43:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-08 18:43:51,382 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:43:51,383 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:51,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2024-11-08 18:43:51,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:43:51,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:43:51,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:51,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1167403971, now seen corresponding path program 1 times
[2024-11-08 18:43:51,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:51,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623226812]
[2024-11-08 18:43:51,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:51,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:43:51,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:43:51,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:43:51,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-08 18:43:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:51,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:51,825 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:43:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 252 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked.
[2024-11-08 18:43:53,693 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:43:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2024-11-08 18:43:54,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:43:54,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623226812]
[2024-11-08 18:43:54,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623226812] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 18:43:54,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 18:43:54,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11
[2024-11-08 18:43:54,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878195407]
[2024-11-08 18:43:54,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 18:43:54,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 18:43:54,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:43:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 18:43:54,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:43:54,257 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32)
[2024-11-08 18:43:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:43:56,288 INFO L93 Difference]: Finished difference Result 192 states and 260 transitions.
[2024-11-08 18:43:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-08 18:43:56,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 103
[2024-11-08 18:43:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:43:56,294 INFO L225 Difference]: With dead ends: 192
[2024-11-08 18:43:56,295 INFO L226 Difference]: Without dead ends: 148
[2024-11-08 18:43:56,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=188, Invalid=318, Unknown=0, NotChecked=0, Total=506
[2024-11-08 18:43:56,298 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 153 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:43:56,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 197 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-08 18:43:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states.
[2024-11-08 18:43:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113.
[2024-11-08 18:43:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 states have internal predecessors, (78), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38)
[2024-11-08 18:43:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions.
[2024-11-08 18:43:56,336 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 103
[2024-11-08 18:43:56,337 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:43:56,337 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions.
[2024-11-08 18:43:56,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32)
[2024-11-08 18:43:56,337 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions.
[2024-11-08 18:43:56,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-08 18:43:56,340 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:43:56,340 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:43:56,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/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
[2024-11-08 18:43:56,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:43:56,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:43:56,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:43:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1847462341, now seen corresponding path program 1 times
[2024-11-08 18:43:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:43:56,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315367120]
[2024-11-08 18:43:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:43:56,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:43:56,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:43:56,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:43:56,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-08 18:43:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:43:56,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-11-08 18:43:56,785 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:44:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-08 18:44:08,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:44:08,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:44:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315367120]
[2024-11-08 18:44:08,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315367120] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:44:08,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:44:08,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-08 18:44:08,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098477140]
[2024-11-08 18:44:08,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:44:08,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-08 18:44:08,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:44:08,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 18:44:08,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-11-08 18:44:08,690 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 18:44:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:44:10,112 INFO L93 Difference]: Finished difference Result 162 states and 214 transitions.
[2024-11-08 18:44:10,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-08 18:44:10,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103
[2024-11-08 18:44:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:44:10,121 INFO L225 Difference]: With dead ends: 162
[2024-11-08 18:44:10,121 INFO L226 Difference]: Without dead ends: 160
[2024-11-08 18:44:10,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210
[2024-11-08 18:44:10,123 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 74 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:44:10,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 373 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-08 18:44:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2024-11-08 18:44:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 121.
[2024-11-08 18:44:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 77 states have internal predecessors, (89), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38)
[2024-11-08 18:44:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 165 transitions.
[2024-11-08 18:44:10,159 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 165 transitions. Word has length 103
[2024-11-08 18:44:10,161 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:44:10,161 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 165 transitions.
[2024-11-08 18:44:10,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-08 18:44:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 165 transitions.
[2024-11-08 18:44:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2024-11-08 18:44:10,167 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:44:10,168 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:44:10,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2024-11-08 18:44:10,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:44:10,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:44:10,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:44:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1594224436, now seen corresponding path program 1 times
[2024-11-08 18:44:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:44:10,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661977814]
[2024-11-08 18:44:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:44:10,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:44:10,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:44:10,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:44:10,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-11-08 18:44:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:44:10,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 18:44:10,593 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:44:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked.
[2024-11-08 18:44:11,440 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:44:11,937 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:44:11,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661977814]
[2024-11-08 18:44:11,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661977814] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 18:44:11,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549308828]
[2024-11-08 18:44:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:44:11,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:44:11,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:44:11,941 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:44:11,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-08 18:44:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:44:12,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 18:44:12,068 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:44:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked.
[2024-11-08 18:44:12,822 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:44:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549308828] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 18:44:13,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 18:44:13,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8
[2024-11-08 18:44:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550939995]
[2024-11-08 18:44:13,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 18:44:13,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 18:44:13,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:44:13,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 18:44:13,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2024-11-08 18:44:13,170 INFO L87 Difference]: Start difference. First operand 121 states and 165 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-08 18:44:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:44:14,198 INFO L93 Difference]: Finished difference Result 233 states and 311 transitions.
[2024-11-08 18:44:14,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-11-08 18:44:14,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104
[2024-11-08 18:44:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:44:14,206 INFO L225 Difference]: With dead ends: 233
[2024-11-08 18:44:14,207 INFO L226 Difference]: Without dead ends: 162
[2024-11-08 18:44:14,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462
[2024-11-08 18:44:14,215 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 65 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 18:44:14,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 289 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 18:44:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2024-11-08 18:44:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 130.
[2024-11-08 18:44:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 85 states have internal predecessors, (98), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38)
[2024-11-08 18:44:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 174 transitions.
[2024-11-08 18:44:14,249 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 174 transitions. Word has length 104
[2024-11-08 18:44:14,250 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:44:14,250 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 174 transitions.
[2024-11-08 18:44:14,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-08 18:44:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 174 transitions.
[2024-11-08 18:44:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2024-11-08 18:44:14,253 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:44:14,253 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:44:14,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-11-08 18:44:14,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/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
[2024-11-08 18:44:14,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:44:14,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:44:14,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:44:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1596071478, now seen corresponding path program 1 times
[2024-11-08 18:44:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:44:14,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146850445]
[2024-11-08 18:44:14,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:44:14,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 18:44:14,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:44:14,659 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 18:44:14,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226f5a61-7f6a-4906-ad34-a9f5161e92c9/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2024-11-08 18:44:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:44:14,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjuncts are in the unsatisfiable core
[2024-11-08 18:44:14,862 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:44:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked.
[2024-11-08 18:44:25,369 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:50:39,819 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse30 ((_ sign_extend 16) c_~var_1_7~0))) (let ((.cse27 (= c_~var_1_10~0 .cse30))) (let ((.cse66 (or .cse27 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse216 ((_ sign_extend 16) ~var_1_6~0)) (.cse215 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse30 .cse215) .cse216) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse216)) (not (= c_~var_1_10~0 .cse215))))))) (.cse67 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse214 ((_ sign_extend 16) ~var_1_6~0)) (.cse213 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse30 .cse213) .cse214) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse214)) (= c_~var_1_10~0 .cse213)))) .cse27)) (.cse68 (or .cse27 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse212 ((_ sign_extend 16) ~var_1_6~0)) (.cse211 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse30 .cse211) .cse212) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse212))) (= c_~var_1_10~0 .cse211)))))) (.cse71 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse210 ((_ sign_extend 16) ~var_1_6~0)) (.cse209 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse30 .cse209) .cse210) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse210))) (not (= c_~var_1_10~0 .cse209))))) .cse27)) (.cse25 (fp.eq c_~var_1_1~0 c_~var_1_9~0))) (let ((.cse11 (= c_~last_1_var_1_10~0 (bvxor c_~last_1_var_1_15~0 c_~last_1_var_1_10~0))) (.cse29 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse208 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse30 .cse208) ((_ sign_extend 16) ~var_1_6~0))) (not (= c_~var_1_10~0 .cse208)))))) (.cse10 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse206 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse207 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 .cse206) .cse207)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse207))))))) (not (= c_~var_1_10~0 .cse206)))))) (.cse26 (not .cse25)) (.cse65 (and .cse66 .cse67 .cse68 .cse71)) (.cse73 (= (_ bv0 8) c_~var_1_11~0)) (.cse170 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse205 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse30 .cse205) ((_ sign_extend 16) ~var_1_6~0)) (not (= c_~var_1_10~0 .cse205)))))) (.cse173 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse203 ((_ zero_extend 24) ~var_1_12~0))) (or (not (= c_~var_1_10~0 .cse203)) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse204 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 .cse203) .cse204) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse204))))))))))) (.cse171 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse202 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse202) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse202)))))))) (.cse72 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse201 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse30 .cse201) ((_ sign_extend 16) ~var_1_6~0)) (= c_~var_1_10~0 .cse201)))))) (let ((.cse41 (bvugt c_~var_1_10~0 (bvadd c_~var_1_10~0 c_~last_1_var_1_15~0 .cse30))) (.cse175 (and .cse171 .cse72)) (.cse176 (and (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse199 ((_ zero_extend 24) ~var_1_12~0))) (or (= c_~var_1_10~0 .cse199) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse200 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 .cse199) .cse200) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse200)))))))))) (or .cse72 .cse27) (or .cse170 .cse27) .cse173)) (.cse48 (not .cse73)) (.cse174 (and (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse195 ((_ zero_extend 24) ~var_1_12~0)) (.cse196 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 .cse195) .cse196) (= c_~var_1_10~0 .cse195) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse196))))))) (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse197 ((_ zero_extend 24) ~var_1_12~0)) (.cse198 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 .cse197) .cse198) (not (= c_~var_1_10~0 .cse197)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse198))))))))) (.cse91 (or .cse26 .cse65)) (.cse156 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse194 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse194) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse194))))))) (.cse33 (= c_~last_1_var_1_10~0 (bvxor c_~last_1_var_1_10~0 c_~last_1_var_1_10~0))) (.cse18 (fp.leq c_~var_1_1~0 c_~var_1_9~0)) (.cse93 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) ((_ sign_extend 16) ~var_1_6~0)))) (.cse22 (bvugt c_~last_1_var_1_15~0 c_~last_1_var_1_10~0)) (.cse81 (bvugt c_~var_1_10~0 (bvadd c_~var_1_10~0 c_~last_1_var_1_15~0 (_ bv4294967291 32)))) (.cse42 (and (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse190 ((_ zero_extend 24) ~var_1_12~0)) (.cse191 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 .cse190) .cse191)) (= c_~var_1_10~0 .cse190) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse191))))))) (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse192 ((_ zero_extend 24) ~var_1_12~0)) (.cse193 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 .cse192) .cse193)) (not (= c_~var_1_10~0 .cse192)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse193))))))))) (.cse4 (or .cse27 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse189 ((_ sign_extend 16) ~var_1_6~0)) (.cse188 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse30 .cse188) .cse189)) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse189)) (= c_~var_1_10~0 .cse188)))))) (.cse6 (or .cse27 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse187 ((_ sign_extend 16) ~var_1_6~0)) (.cse186 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse30 .cse186) .cse187)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse187))) (= c_~var_1_10~0 .cse186)))))) (.cse123 (or .cse27 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse185 ((_ sign_extend 16) ~var_1_6~0)) (.cse184 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse30 .cse184) .cse185)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse185))) (not (= c_~var_1_10~0 .cse184))))))) (.cse124 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse183 ((_ sign_extend 16) ~var_1_6~0)) (.cse182 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse30 .cse182) .cse183)) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse183)) (not (= c_~var_1_10~0 .cse182))))) .cse27)) (.cse40 (and (or .cse29 .cse27) .cse10 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse179 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse180 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 .cse179) .cse180)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse180))))))) (= c_~var_1_10~0 .cse179)))) (or .cse27 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse181 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse30 .cse181) ((_ sign_extend 16) ~var_1_6~0))) (= c_~var_1_10~0 .cse181))))))) (.cse46 (= (_ bv0 32) (bvadd (_ bv5 32) .cse30))) (.cse3 (not .cse11)) (.cse28 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (not (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) ((_ sign_extend 16) ~var_1_6~0))))) (.cse43 (= (bvadd (_ bv5 32) c_~var_1_15~0) (_ bv0 32)))) (let ((.cse44 (not .cse43)) (.cse16 (or .cse3 .cse28)) (.cse9 (or .cse25 .cse28)) (.cse47 (not .cse46)) (.cse34 (or .cse40 .cse25)) (.cse8 (or .cse28 .cse73)) (.cse35 (or (and .cse4 .cse6 .cse123 .cse124) .cse26)) (.cse36 (or .cse42 .cse25)) (.cse79 (not .cse81)) (.cse96 (= (_ bv0 32) (bvadd c_~var_1_10~0 (_ bv5 32)))) (.cse24 (not .cse22)) (.cse70 (or .cse93 .cse25)) (.cse1 (not .cse18)) (.cse64 (or .cse3 .cse93)) (.cse0 (not .cse33)) (.cse37 (= c_~var_1_15~0 .cse30)) (.cse86 (or .cse25 .cse156 .cse73)) (.cse87 (or .cse48 (and (or .cse25 .cse174) .cse91))) (.cse90 (or .cse176 .cse25)) (.cse88 (or .cse175 .cse25)) (.cse89 (or .cse26 .cse72)) (.cse19 (not .cse41))) (and (or (let ((.cse5 (or .cse41 .cse28))) (let ((.cse13 (or .cse42 .cse19)) (.cse14 (or .cse19 .cse40)) (.cse15 (or .cse42 .cse41)) (.cse17 (or .cse40 .cse41)) (.cse7 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse38 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse39 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 .cse38) .cse39)) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse39)))))) (not (= c_~var_1_10~0 .cse38)))))) (.cse2 (or .cse37 .cse28)) (.cse12 (and .cse5 .cse34 .cse8 .cse35 .cse36))) (and (or .cse0 (and (or .cse1 (and .cse2 (or .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse11 .cse12))) (or (and .cse13 .cse14 .cse15 .cse2 .cse8 .cse16 .cse17) .cse18))) (or (let ((.cse21 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse32 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse32)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse32))))))) (.cse20 (and (or .cse27 .cse28) .cse29 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse31 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse31)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse31)))))))))) (and (or (and .cse2 (or .cse3 (and .cse15 .cse8 (or .cse19 .cse20) .cse17 (or .cse19 .cse21))) (or .cse11 (let ((.cse23 (and .cse13 .cse14 .cse15 .cse8 .cse17))) (and (or .cse22 .cse23) (or .cse23 .cse24))))) .cse18) (or (and (or (and .cse5 .cse8 (or .cse25 .cse21) (or .cse26 (and .cse4 .cse6 .cse7 .cse10)) (or .cse25 .cse20)) .cse3) .cse2 (or .cse11 (and (or .cse22 .cse12) (or .cse24 .cse12)))) .cse1))) .cse33)))) .cse43) (or .cse44 (let ((.cse75 (or .cse96 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse117 ((_ sign_extend 16) ~var_1_6~0)) (.cse116 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse116) .cse117) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse117)) (= c_~var_1_10~0 .cse116)))))) (.cse76 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse114 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse115 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse114) .cse115) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse115))))))) (not (= c_~var_1_10~0 .cse114)))))) (.cse77 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse112 ((_ zero_extend 24) ~var_1_12~0))) (or (not (= c_~var_1_10~0 .cse112)) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse113 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse112) .cse113) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse113)))))))))) (.cse78 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse110 ((_ zero_extend 24) ~var_1_12~0)) (.cse111 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse110) .cse111) (= c_~var_1_10~0 .cse110) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse111)))))) .cse96))) (let ((.cse97 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse109 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) ((_ zero_extend 24) ~var_1_12~0)) .cse109) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse109))))))) (.cse80 (and .cse75 .cse76 .cse77 .cse78))) (let ((.cse106 (or .cse26 .cse80)) (.cse99 (or .cse25 .cse97))) (let ((.cse95 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse108 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse108) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse108)))))))) (.cse62 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse107 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse107) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse107))))))) (.cse85 (and .cse106 .cse99)) (.cse84 (and (or (and (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse105 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) ((_ zero_extend 24) ~var_1_12~0)) .cse105) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse105))))))) .cse96) .cse25) .cse106)) (.cse74 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse104 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse104) ((_ sign_extend 16) ~var_1_6~0)) (= c_~var_1_10~0 .cse104)))))) (let ((.cse82 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse102 ((_ zero_extend 24) ~var_1_12~0))) (or (= c_~var_1_10~0 .cse102) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse103 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse102) .cse103) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse103)))))))))) (.cse83 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse100 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse101 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse100) .cse101) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse101))))))) (= c_~var_1_10~0 .cse100))))) (.cse51 (or (let ((.cse98 (and .cse74 .cse99))) (and (or .cse79 .cse98) (or .cse81 .cse98))) .cse73)) (.cse52 (or .cse79 .cse84)) (.cse49 (or .cse79 .cse85)) (.cse54 (or (and (or .cse81 .cse25 .cse97) (or .cse79 .cse25 .cse97)) .cse73)) (.cse69 (or .cse19 .cse93)) (.cse92 (and (or .cse79 .cse62) (or .cse81 .cse62))) (.cse63 (and .cse95 (or .cse96 .cse93)))) (let ((.cse57 (or (let ((.cse94 (and .cse95 .cse72))) (and (or .cse81 .cse94) (or .cse94 .cse79))) .cse73)) (.cse58 (or .cse48 (and (or .cse81 .cse63) (or .cse79 .cse63)))) (.cse59 (or .cse92 .cse48)) (.cse61 (or .cse46 .cse93)) (.cse60 (or .cse92 .cse73)) (.cse45 (and .cse86 .cse87 (or (and .cse69 .cse88 .cse89) .cse73) (or .cse48 (and .cse69 .cse90 .cse91)))) (.cse55 (and .cse51 (or .cse48 (and .cse52 (or .cse81 .cse84))) (or (and .cse49 (or .cse81 .cse85)) .cse48) .cse54)) (.cse53 (or .cse81 (and .cse76 .cse82 .cse77 .cse25 .cse83))) (.cse50 (or .cse81 (and .cse76 .cse82 .cse77 .cse83)))) (and (or (and (or (and (or (and (or .cse45 .cse3) (or .cse11 (and (or .cse45 .cse24) (or .cse22 .cse45)))) .cse46) (or .cse47 (and (or (and (or .cse48 (and .cse49 .cse50)) .cse51 (or .cse48 (and .cse52 .cse53)) .cse54) .cse3) (or (and (or .cse55 .cse24) (or .cse22 .cse55)) .cse11)))) .cse1) (or (and (or (let ((.cse56 (and .cse57 .cse58 .cse59 .cse60))) (and (or .cse22 .cse56) (or .cse24 .cse56))) .cse11) .cse61 (or .cse3 (and .cse57 (or .cse48 .cse62) (or .cse48 .cse63) .cse60))) .cse18)) .cse33) (or .cse0 (and (or (and .cse57 .cse58 .cse59 .cse61 .cse64 .cse60) .cse18) (or (and (or .cse46 (and (or .cse45 .cse11) (or .cse3 (and (or .cse48 .cse65) (or (and .cse66 .cse67 .cse68 .cse69 .cse70 .cse71) .cse48) (or (and .cse69 .cse70 .cse72) .cse73))))) (or .cse47 (and (or .cse55 .cse11) (or (and (or (and .cse74 .cse25) .cse73) (or .cse48 (and (or (and .cse75 .cse76 .cse77 .cse25 .cse78) .cse79) .cse53)) (or (and .cse50 (or .cse79 .cse80)) .cse48)) .cse3)))) .cse1))))))))))) (or .cse44 (let ((.cse137 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse152 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse153 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse152) .cse153)) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse153)))))) (not (= c_~var_1_10~0 .cse152)))))) (.cse138 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse150 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse151 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse150) .cse151)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse151))))))) (not (= c_~var_1_10~0 .cse150))))))) (let ((.cse128 (and .cse137 .cse138 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse147 ((_ sign_extend 16) ~var_1_6~0)) (.cse146 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse146) .cse147)) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse147)) (= c_~var_1_10~0 .cse146)))) .cse96) (or .cse96 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse148 ((_ zero_extend 24) ~var_1_12~0)) (.cse149 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse148) .cse149)) (= c_~var_1_10~0 .cse148) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse149)))))))))) (let ((.cse136 (and (or .cse128 .cse26) (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse145 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) ((_ zero_extend 24) ~var_1_12~0)) .cse145)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse145)))))) .cse25))) (.cse131 (or .cse96 .cse28)) (.cse132 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse144 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse144)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse144))))))))) (let ((.cse134 (and .cse131 .cse132)) (.cse135 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse143 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse143)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse143))))))) (.cse130 (or .cse79 .cse136)) (.cse125 (or .cse19 .cse28))) (let ((.cse126 (and .cse34 .cse8 .cse35 .cse36 .cse125)) (.cse127 (or .cse81 (and .cse137 .cse138 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse139 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse140 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse139) .cse140)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse140))))))) (= c_~var_1_10~0 .cse139)))) (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse141 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse142 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse141) .cse142)) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse142)))))) (= c_~var_1_10~0 .cse141))))))) (.cse129 (and (or .cse81 .cse136) .cse130 .cse73)) (.cse119 (or .cse46 .cse28)) (.cse118 (or .cse81 .cse135)) (.cse120 (or .cse135 .cse79)) (.cse121 (or .cse81 .cse134)) (.cse122 (or .cse134 .cse79))) (and (or (and (or .cse18 (and .cse118 .cse119 .cse8 .cse120 .cse121 .cse16 .cse122)) (or (and (or .cse46 (and (or (and .cse4 .cse6 .cse8 .cse9 .cse123 .cse124 .cse125) .cse3) (or .cse126 .cse11))) (or .cse47 (and (or (and .cse127 (or .cse128 .cse79) .cse73) .cse3) (or .cse129 .cse11)))) .cse1)) .cse0) (or (and (or (and (or (and (or (and (or .cse22 .cse126) (or .cse126 .cse24)) .cse11) (or .cse3 .cse126)) .cse46) (or .cse47 (and (or .cse3 (and .cse127 .cse130 .cse73)) (or .cse11 (and (or .cse22 .cse129) (or .cse129 .cse24)))))) .cse1) (or (and .cse119 (or .cse3 (and .cse131 .cse8 .cse132)) (or .cse11 (let ((.cse133 (and .cse118 .cse8 .cse120 .cse121 .cse122))) (and (or .cse133 .cse24) (or .cse22 .cse133))))) .cse18)) .cse33)))))))) (or .cse43 (let ((.cse159 (or .cse93 .cse41))) (let ((.cse167 (or .cse41 .cse174)) (.cse169 (or .cse176 .cse41)) (.cse168 (or .cse19 .cse156)) (.cse172 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse177 ((_ zero_extend 24) ~var_1_12~0))) (or (not (= c_~var_1_10~0 .cse177)) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse178 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 .cse177) .cse178) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse178)))))))))) (.cse160 (or (and .cse88 .cse89 .cse159) .cse73))) (let ((.cse154 (and .cse86 .cse87 (or (and .cse90 .cse91 .cse159) .cse48) .cse160)) (.cse161 (and .cse67 .cse68 .cse172 .cse173)) (.cse163 (or (and (or .cse41 .cse156) .cse168) .cse73)) (.cse164 (or .cse48 (and .cse169 (or .cse19 .cse176)))) (.cse155 (or .cse93 .cse37)) (.cse165 (or (and (or .cse175 .cse41) (or .cse175 .cse19)) .cse73)) (.cse166 (or (and (or .cse19 .cse174) .cse167) .cse48))) (and (or .cse33 (let ((.cse158 (and (or .cse93 .cse27) .cse170 .cse171))) (and (or (and (or (and (or .cse22 .cse154) (or .cse154 .cse24)) .cse11) .cse155 (or (let ((.cse157 (or .cse26 .cse161))) (and .cse86 (or .cse48 (and (or .cse25 .cse156) .cse157)) (or .cse48 (and (or .cse25 .cse158) .cse157 .cse159)) .cse160)) .cse3)) .cse1) (or (and (or .cse11 (let ((.cse162 (and .cse163 .cse164 .cse165 .cse166))) (and (or .cse22 .cse162) (or .cse24 .cse162)))) .cse155 (or (and (or .cse48 (and .cse167 .cse168)) .cse163 (or (and .cse169 (or .cse19 .cse158)) .cse48) .cse165) .cse3)) .cse18)))) (or (and (or (and .cse155 (or .cse154 .cse11) (or (and (or .cse48 (and .cse67 .cse68 .cse172 .cse70 .cse173 .cse159)) (or .cse48 .cse161) (or (and .cse70 .cse72 .cse159) .cse73)) .cse3)) .cse1) (or (and .cse163 .cse164 .cse155 .cse64 .cse165 .cse166) .cse18)) .cse0))))))))))))) is different from true
[2024-11-08 18:55:52,628 WARN L286 SmtUtils]: Spent 3.38m on a formula simplification. DAG size of input: 359 DAG size of output: 357 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)