./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.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_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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_a1c91f98-1db1-4136-8aff-1f046a63234e/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 908ebf0ce710b19ef334a87c76f83c10f178a5493f5ed2ea191592b95f89ac2f
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 16:46:56,280 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 16:46:56,374 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 16:46:56,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 16:46:56,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 16:46:56,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 16:46:56,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 16:46:56,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 16:46:56,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 16:46:56,401 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 16:46:56,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 16:46:56,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 16:46:56,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 16:46:56,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 16:46:56,403 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 16:46:56,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 16:46:56,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 16:46:56,404 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 16:46:56,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 16:46:56,405 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 16:46:56,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 16:46:56,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 16:46:56,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 16:46:56,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 16:46:56,407 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 16:46:56,407 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 16:46:56,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 16:46:56,408 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 16:46:56,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 16:46:56,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 16:46:56,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 16:46:56,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 16:46:56,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 16:46:56,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 16:46:56,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 16:46:56,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 16:46:56,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 16:46:56,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 16:46:56,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 16:46:56,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 16:46:56,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 16:46:56,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 16:46:56,417 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_a1c91f98-1db1-4136-8aff-1f046a63234e/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_a1c91f98-1db1-4136-8aff-1f046a63234e/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 -> 908ebf0ce710b19ef334a87c76f83c10f178a5493f5ed2ea191592b95f89ac2f
[2024-11-08 16:46:56,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 16:46:56,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 16:46:56,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 16:46:56,711 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 16:46:56,712 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 16:46:56,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i
Unable to find full path for "g++"
[2024-11-08 16:46:58,646 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 16:46:58,852 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 16:46:58,852 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i
[2024-11-08 16:46:58,862 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/data/b9cee904e/271f4bd3d54f406e8b901f29160ca199/FLAG8398efb4d
[2024-11-08 16:46:58,877 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/data/b9cee904e/271f4bd3d54f406e8b901f29160ca199
[2024-11-08 16:46:58,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 16:46:58,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 16:46:58,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 16:46:58,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 16:46:58,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 16:46:58,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:46:58" (1/1) ...
[2024-11-08 16:46:58,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322c3507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:58, skipping insertion in model container
[2024-11-08 16:46:58,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:46:58" (1/1) ...
[2024-11-08 16:46:58,926 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 16:46:59,129 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_a1c91f98-1db1-4136-8aff-1f046a63234e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i[919,932]
[2024-11-08 16:46:59,220 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 16:46:59,232 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 16:46:59,245 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_a1c91f98-1db1-4136-8aff-1f046a63234e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i[919,932]
[2024-11-08 16:46:59,294 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 16:46:59,315 INFO L204 MainTranslator]: Completed translation
[2024-11-08 16:46:59,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59 WrapperNode
[2024-11-08 16:46:59,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 16:46:59,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 16:46:59,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 16:46:59,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 16:46:59,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (1/1) ...
[2024-11-08 16:46:59,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (1/1) ...
[2024-11-08 16:46:59,423 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251
[2024-11-08 16:46:59,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 16:46:59,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 16:46:59,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 16:46:59,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 16:46:59,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (1/1) ...
[2024-11-08 16:46:59,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (1/1) ...
[2024-11-08 16:46:59,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (1/1) ...
[2024-11-08 16:46:59,488 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 16:46:59,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (1/1) ...
[2024-11-08 16:46:59,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (1/1) ...
[2024-11-08 16:46:59,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (1/1) ...
[2024-11-08 16:46:59,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (1/1) ...
[2024-11-08 16:46:59,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (1/1) ...
[2024-11-08 16:46:59,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (1/1) ...
[2024-11-08 16:46:59,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 16:46:59,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 16:46:59,584 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 16:46:59,584 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 16:46:59,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (1/1) ...
[2024-11-08 16:46:59,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 16:46:59,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:46:59,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 16:46:59,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 16:46:59,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 16:46:59,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 16:46:59,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 16:46:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 16:46:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 16:46:59,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 16:46:59,772 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 16:46:59,778 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 16:47:00,357 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live.
[2024-11-08 16:47:00,359 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 16:47:00,377 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 16:47:00,378 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 16:47:00,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:47:00 BoogieIcfgContainer
[2024-11-08 16:47:00,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 16:47:00,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 16:47:00,382 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 16:47:00,386 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 16:47:00,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:46:58" (1/3) ...
[2024-11-08 16:47:00,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750a15d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:47:00, skipping insertion in model container
[2024-11-08 16:47:00,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:59" (2/3) ...
[2024-11-08 16:47:00,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750a15d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:47:00, skipping insertion in model container
[2024-11-08 16:47:00,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:47:00" (3/3) ...
[2024-11-08 16:47:00,391 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i
[2024-11-08 16:47:00,410 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 16:47:00,411 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 16:47:00,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 16:47:00,491 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;@69e5a276, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 16:47:00,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 16:47:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 84 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 16:47:00,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-11-08 16:47:00,517 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:00,518 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:00,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:00,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:00,525 INFO L85 PathProgramCache]: Analyzing trace with hash 637088318, now seen corresponding path program 1 times
[2024-11-08 16:47:00,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:00,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336693463]
[2024-11-08 16:47:00,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:00,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:00,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:47:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:00,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 16:47:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:00,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 16:47:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:00,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-08 16:47:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:00,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 16:47:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-08 16:47:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:00,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 16:47:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 16:47:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 16:47:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 16:47:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 16:47:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:47:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 16:47:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:47:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 16:47:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:47:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 16:47:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:47:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 16:47:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 16:47:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2024-11-08 16:47:01,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:01,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336693463]
[2024-11-08 16:47:01,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336693463] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:01,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:01,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 16:47:01,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004044881]
[2024-11-08 16:47:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:01,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 16:47:01,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:01,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 16:47:01,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 16:47:01,146 INFO L87 Difference]: Start difference. First operand has 106 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 84 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2024-11-08 16:47:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:47:01,194 INFO L93 Difference]: Finished difference Result 205 states and 346 transitions.
[2024-11-08 16:47:01,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 16:47:01,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140
[2024-11-08 16:47:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:47:01,209 INFO L225 Difference]: With dead ends: 205
[2024-11-08 16:47:01,210 INFO L226 Difference]: Without dead ends: 102
[2024-11-08 16:47:01,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 16:47:01,222 INFO L432 NwaCegarLoop]: 156 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, 156 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 16:47:01,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 16:47:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2024-11-08 16:47:01,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102.
[2024-11-08 16:47:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 16:47:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 156 transitions.
[2024-11-08 16:47:01,292 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 156 transitions. Word has length 140
[2024-11-08 16:47:01,295 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:47:01,295 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 156 transitions.
[2024-11-08 16:47:01,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2024-11-08 16:47:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions.
[2024-11-08 16:47:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-11-08 16:47:01,304 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:01,305 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:01,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 16:47:01,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:01,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:01,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1353862330, now seen corresponding path program 1 times
[2024-11-08 16:47:01,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:01,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584953802]
[2024-11-08 16:47:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:01,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:47:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 16:47:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 16:47:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-08 16:47:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 16:47:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-08 16:47:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 16:47:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 16:47:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 16:47:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 16:47:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 16:47:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:47:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 16:47:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:47:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 16:47:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:47:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 16:47:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:47:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 16:47:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 16:47:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2024-11-08 16:47:01,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:01,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584953802]
[2024-11-08 16:47:01,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584953802] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:01,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:01,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 16:47:01,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645141151]
[2024-11-08 16:47:01,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:01,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 16:47:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:01,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 16:47:01,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 16:47:01,645 INFO L87 Difference]: Start difference. First operand 102 states and 156 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:47:01,783 INFO L93 Difference]: Finished difference Result 286 states and 439 transitions.
[2024-11-08 16:47:01,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 16:47:01,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140
[2024-11-08 16:47:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:47:01,786 INFO L225 Difference]: With dead ends: 286
[2024-11-08 16:47:01,787 INFO L226 Difference]: Without dead ends: 187
[2024-11-08 16:47:01,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 16:47:01,791 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 141 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 16:47:01,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 346 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 16:47:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states.
[2024-11-08 16:47:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 140.
[2024-11-08 16:47:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 16:47:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 213 transitions.
[2024-11-08 16:47:01,831 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 213 transitions. Word has length 140
[2024-11-08 16:47:01,833 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:47:01,837 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 213 transitions.
[2024-11-08 16:47:01,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 213 transitions.
[2024-11-08 16:47:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-11-08 16:47:01,842 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:01,842 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:01,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 16:47:01,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:01,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash -931160504, now seen corresponding path program 1 times
[2024-11-08 16:47:01,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:01,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421973507]
[2024-11-08 16:47:01,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:01,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:47:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 16:47:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 16:47:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-08 16:47:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 16:47:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-08 16:47:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 16:47:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 16:47:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 16:47:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 16:47:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 16:47:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:47:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 16:47:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:47:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 16:47:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:47:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 16:47:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:47:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 16:47:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 16:47:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2024-11-08 16:47:02,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:02,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421973507]
[2024-11-08 16:47:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421973507] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:02,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:02,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 16:47:02,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134244935]
[2024-11-08 16:47:02,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:02,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 16:47:02,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:02,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 16:47:02,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 16:47:02,128 INFO L87 Difference]: Start difference. First operand 140 states and 213 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:47:02,203 INFO L93 Difference]: Finished difference Result 324 states and 490 transitions.
[2024-11-08 16:47:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 16:47:02,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140
[2024-11-08 16:47:02,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:47:02,209 INFO L225 Difference]: With dead ends: 324
[2024-11-08 16:47:02,209 INFO L226 Difference]: Without dead ends: 187
[2024-11-08 16:47:02,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 16:47:02,214 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 118 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 16:47:02,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 282 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 16:47:02,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states.
[2024-11-08 16:47:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 140.
[2024-11-08 16:47:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.423728813559322) internal successors, (168), 118 states have internal predecessors, (168), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 16:47:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 208 transitions.
[2024-11-08 16:47:02,228 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 208 transitions. Word has length 140
[2024-11-08 16:47:02,229 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:47:02,229 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 208 transitions.
[2024-11-08 16:47:02,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 208 transitions.
[2024-11-08 16:47:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-11-08 16:47:02,232 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:02,233 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:02,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 16:47:02,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:02,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:02,234 INFO L85 PathProgramCache]: Analyzing trace with hash -672995066, now seen corresponding path program 1 times
[2024-11-08 16:47:02,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222481760]
[2024-11-08 16:47:02,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:02,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:47:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 16:47:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 16:47:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-08 16:47:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 16:47:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-08 16:47:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 16:47:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 16:47:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 16:47:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 16:47:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 16:47:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:47:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 16:47:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:47:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 16:47:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:47:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 16:47:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:47:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 16:47:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 16:47:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2024-11-08 16:47:02,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:02,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222481760]
[2024-11-08 16:47:02,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222481760] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:02,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:02,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 16:47:02,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885390585]
[2024-11-08 16:47:02,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:02,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 16:47:02,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:02,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 16:47:02,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 16:47:02,819 INFO L87 Difference]: Start difference. First operand 140 states and 208 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:47:03,256 INFO L93 Difference]: Finished difference Result 403 states and 600 transitions.
[2024-11-08 16:47:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 16:47:03,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140
[2024-11-08 16:47:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:47:03,260 INFO L225 Difference]: With dead ends: 403
[2024-11-08 16:47:03,260 INFO L226 Difference]: Without dead ends: 266
[2024-11-08 16:47:03,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2024-11-08 16:47:03,262 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 145 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 16:47:03,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 505 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 16:47:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2024-11-08 16:47:03,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 224.
[2024-11-08 16:47:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 181 states have (on average 1.3977900552486189) internal successors, (253), 181 states have internal predecessors, (253), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40)
[2024-11-08 16:47:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 333 transitions.
[2024-11-08 16:47:03,287 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 333 transitions. Word has length 140
[2024-11-08 16:47:03,287 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:47:03,288 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 333 transitions.
[2024-11-08 16:47:03,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 333 transitions.
[2024-11-08 16:47:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2024-11-08 16:47:03,290 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:03,291 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:03,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 16:47:03,291 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:03,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:03,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1580063162, now seen corresponding path program 1 times
[2024-11-08 16:47:03,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:03,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782926309]
[2024-11-08 16:47:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:03,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:47:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 16:47:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 16:47:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-08 16:47:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 16:47:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-08 16:47:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 16:47:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 16:47:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 16:47:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 16:47:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 16:47:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:47:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 16:47:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:47:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 16:47:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:47:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 16:47:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:47:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 16:47:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 16:47:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2024-11-08 16:47:04,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782926309]
[2024-11-08 16:47:04,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782926309] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:04,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:04,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 16:47:04,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014017205]
[2024-11-08 16:47:04,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:04,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 16:47:04,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:04,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 16:47:04,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 16:47:04,191 INFO L87 Difference]: Start difference. First operand 224 states and 333 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:47:05,160 INFO L93 Difference]: Finished difference Result 605 states and 897 transitions.
[2024-11-08 16:47:05,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 16:47:05,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141
[2024-11-08 16:47:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:47:05,164 INFO L225 Difference]: With dead ends: 605
[2024-11-08 16:47:05,165 INFO L226 Difference]: Without dead ends: 384
[2024-11-08 16:47:05,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-11-08 16:47:05,170 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 219 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-08 16:47:05,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 780 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-08 16:47:05,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states.
[2024-11-08 16:47:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 328.
[2024-11-08 16:47:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 264 states have (on average 1.3863636363636365) internal successors, (366), 264 states have internal predecessors, (366), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60)
[2024-11-08 16:47:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 486 transitions.
[2024-11-08 16:47:05,219 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 486 transitions. Word has length 141
[2024-11-08 16:47:05,220 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:47:05,220 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 486 transitions.
[2024-11-08 16:47:05,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 486 transitions.
[2024-11-08 16:47:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2024-11-08 16:47:05,224 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:05,224 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:05,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 16:47:05,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:05,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:05,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1429141280, now seen corresponding path program 1 times
[2024-11-08 16:47:05,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:05,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402018498]
[2024-11-08 16:47:05,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:05,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:47:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 16:47:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 16:47:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-08 16:47:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 16:47:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-08 16:47:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 16:47:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 16:47:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 16:47:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 16:47:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 16:47:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:47:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 16:47:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:47:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 16:47:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:47:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 16:47:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:47:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 16:47:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 16:47:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2024-11-08 16:47:05,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:05,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402018498]
[2024-11-08 16:47:05,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402018498] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:05,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:05,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 16:47:05,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999443992]
[2024-11-08 16:47:05,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:05,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 16:47:05,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:05,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 16:47:05,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 16:47:05,756 INFO L87 Difference]: Start difference. First operand 328 states and 486 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:47:06,699 INFO L93 Difference]: Finished difference Result 918 states and 1352 transitions.
[2024-11-08 16:47:06,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 16:47:06,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142
[2024-11-08 16:47:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:47:06,707 INFO L225 Difference]: With dead ends: 918
[2024-11-08 16:47:06,708 INFO L226 Difference]: Without dead ends: 781
[2024-11-08 16:47:06,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-11-08 16:47:06,709 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 329 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 16:47:06,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 941 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 16:47:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states.
[2024-11-08 16:47:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 590.
[2024-11-08 16:47:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 484 states have (on average 1.3863636363636365) internal successors, (671), 484 states have internal predecessors, (671), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100)
[2024-11-08 16:47:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 871 transitions.
[2024-11-08 16:47:06,793 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 871 transitions. Word has length 142
[2024-11-08 16:47:06,794 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:47:06,794 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 871 transitions.
[2024-11-08 16:47:06,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 871 transitions.
[2024-11-08 16:47:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2024-11-08 16:47:06,796 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:06,796 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:06,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 16:47:06,797 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:06,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash 584280305, now seen corresponding path program 1 times
[2024-11-08 16:47:06,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:06,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629856325]
[2024-11-08 16:47:06,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:06,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:47:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 16:47:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 16:47:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-08 16:47:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 16:47:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-08 16:47:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 16:47:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 16:47:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 16:47:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 16:47:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 16:47:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:47:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 16:47:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:47:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 16:47:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:47:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 16:47:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:47:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 16:47:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 16:47:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2024-11-08 16:47:07,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:07,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629856325]
[2024-11-08 16:47:07,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629856325] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:07,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:07,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 16:47:07,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9589698]
[2024-11-08 16:47:07,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:07,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 16:47:07,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:07,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 16:47:07,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 16:47:07,227 INFO L87 Difference]: Start difference. First operand 590 states and 871 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:47:07,369 INFO L93 Difference]: Finished difference Result 1217 states and 1799 transitions.
[2024-11-08 16:47:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 16:47:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142
[2024-11-08 16:47:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:47:07,374 INFO L225 Difference]: With dead ends: 1217
[2024-11-08 16:47:07,374 INFO L226 Difference]: Without dead ends: 630
[2024-11-08 16:47:07,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 16:47:07,376 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 123 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 16:47:07,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 488 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 16:47:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states.
[2024-11-08 16:47:07,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 590.
[2024-11-08 16:47:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 484 states have (on average 1.365702479338843) internal successors, (661), 484 states have internal predecessors, (661), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100)
[2024-11-08 16:47:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 861 transitions.
[2024-11-08 16:47:07,459 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 861 transitions. Word has length 142
[2024-11-08 16:47:07,460 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:47:07,460 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 861 transitions.
[2024-11-08 16:47:07,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 861 transitions.
[2024-11-08 16:47:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147
[2024-11-08 16:47:07,462 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:07,462 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:07,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 16:47:07,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:07,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash 296423464, now seen corresponding path program 1 times
[2024-11-08 16:47:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:07,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934104339]
[2024-11-08 16:47:07,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:07,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:47:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 16:47:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 16:47:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-08 16:47:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 16:47:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-08 16:47:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 16:47:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44
[2024-11-08 16:47:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 16:47:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 16:47:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 16:47:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:47:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 16:47:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:47:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 16:47:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:47:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 16:47:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:47:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 16:47:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 16:47:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2024-11-08 16:47:15,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:15,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934104339]
[2024-11-08 16:47:15,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934104339] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:15,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:15,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-08 16:47:15,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148165680]
[2024-11-08 16:47:15,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:15,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-08 16:47:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:15,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 16:47:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2024-11-08 16:47:15,874 INFO L87 Difference]: Start difference. First operand 590 states and 861 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:47:19,838 INFO L93 Difference]: Finished difference Result 1303 states and 1871 transitions.
[2024-11-08 16:47:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-08 16:47:19,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146
[2024-11-08 16:47:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:47:19,843 INFO L225 Difference]: With dead ends: 1303
[2024-11-08 16:47:19,843 INFO L226 Difference]: Without dead ends: 1082
[2024-11-08 16:47:19,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182
[2024-11-08 16:47:19,845 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 181 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2024-11-08 16:47:19,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 617 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2024-11-08 16:47:19,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states.
[2024-11-08 16:47:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1035.
[2024-11-08 16:47:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 914 states have (on average 1.3905908096280089) internal successors, (1271), 919 states have internal predecessors, (1271), 110 states have call successors, (110), 10 states have call predecessors, (110), 10 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110)
[2024-11-08 16:47:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1491 transitions.
[2024-11-08 16:47:19,978 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1491 transitions. Word has length 146
[2024-11-08 16:47:19,978 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:47:19,979 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1491 transitions.
[2024-11-08 16:47:19,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1491 transitions.
[2024-11-08 16:47:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147
[2024-11-08 16:47:19,981 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:19,981 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:19,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 16:47:19,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:19,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:19,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1682626858, now seen corresponding path program 1 times
[2024-11-08 16:47:19,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:19,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913010527]
[2024-11-08 16:47:19,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:19,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-08 16:47:20,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096531138]
[2024-11-08 16:47:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:20,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:47:20,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:47:20,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:47:20,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 16:47:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 16:47:20,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 16:47:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 16:47:20,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 16:47:20,663 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 16:47:20,665 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 16:47:20,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 16:47:20,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2024-11-08 16:47:20,870 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:21,014 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 16:47:21,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:47:21 BoogieIcfgContainer
[2024-11-08 16:47:21,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 16:47:21,019 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 16:47:21,019 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 16:47:21,019 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 16:47:21,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:47:00" (3/4) ...
[2024-11-08 16:47:21,022 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 16:47:21,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 16:47:21,024 INFO L158 Benchmark]: Toolchain (without parser) took 22143.18ms. Allocated memory was 140.5MB in the beginning and 310.4MB in the end (delta: 169.9MB). Free memory was 104.1MB in the beginning and 264.4MB in the end (delta: -160.4MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB.
[2024-11-08 16:47:21,025 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 16:47:21,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.84ms. Allocated memory is still 140.5MB. Free memory was 104.1MB in the beginning and 86.1MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-11-08 16:47:21,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.77ms. Allocated memory is still 140.5MB. Free memory was 86.1MB in the beginning and 79.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-08 16:47:21,025 INFO L158 Benchmark]: Boogie Preprocessor took 158.35ms. Allocated memory is still 140.5MB. Free memory was 79.8MB in the beginning and 110.4MB in the end (delta: -30.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB.
[2024-11-08 16:47:21,026 INFO L158 Benchmark]: RCFGBuilder took 795.61ms. Allocated memory is still 140.5MB. Free memory was 110.4MB in the beginning and 73.7MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB.
[2024-11-08 16:47:21,026 INFO L158 Benchmark]: TraceAbstraction took 20636.09ms. Allocated memory was 140.5MB in the beginning and 310.4MB in the end (delta: 169.9MB). Free memory was 72.9MB in the beginning and 265.5MB in the end (delta: -192.6MB). Peak memory consumption was 153.3MB. Max. memory is 16.1GB.
[2024-11-08 16:47:21,026 INFO L158 Benchmark]: Witness Printer took 5.25ms. Allocated memory is still 310.4MB. Free memory was 265.5MB in the beginning and 264.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 16:47:21,028 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.21ms. Allocated memory is still 102.8MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 433.84ms. Allocated memory is still 140.5MB. Free memory was 104.1MB in the beginning and 86.1MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 106.77ms. Allocated memory is still 140.5MB. Free memory was 86.1MB in the beginning and 79.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 158.35ms. Allocated memory is still 140.5MB. Free memory was 79.8MB in the beginning and 110.4MB in the end (delta: -30.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB.
* RCFGBuilder took 795.61ms. Allocated memory is still 140.5MB. Free memory was 110.4MB in the beginning and 73.7MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 20636.09ms. Allocated memory was 140.5MB in the beginning and 310.4MB in the end (delta: 169.9MB). Free memory was 72.9MB in the beginning and 265.5MB in the end (delta: -192.6MB). Peak memory consumption was 153.3MB. Max. memory is 16.1GB.
* Witness Printer took 5.25ms. Allocated memory is still 310.4MB. Free memory was 265.5MB in the beginning and 264.4MB in the end (delta: 1.0MB). 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 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 126.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned long int var_1_1 = 2;
[L23] signed long int var_1_5 = 5;
[L24] unsigned char var_1_8 = 0;
[L25] float var_1_9 = 128.6;
[L26] float var_1_10 = 32.5;
[L27] unsigned char var_1_11 = 16;
[L28] unsigned char var_1_12 = 64;
[L29] unsigned char var_1_13 = 4;
[L30] unsigned char var_1_14 = 4;
[L31] unsigned long int var_1_15 = 0;
[L32] signed short int var_1_16 = 0;
[L33] signed char var_1_17 = 1;
[L34] signed char var_1_18 = -1;
[L35] signed char var_1_19 = 0;
[L36] signed long int var_1_20 = -64;
[L37] unsigned char var_1_22 = 0;
[L38] unsigned char var_1_23 = 0;
[L39] signed short int var_1_24 = -4;
[L40] unsigned short int var_1_29 = 8;
[L41] unsigned short int var_1_33 = 48416;
[L42] unsigned char var_1_35 = 4;
[L43] unsigned long int var_1_37 = 32;
[L44] unsigned char var_1_38 = 8;
[L45] double var_1_40 = 31.75;
[L46] double var_1_41 = 5.5;
[L47] signed char var_1_43 = 100;
[L48] signed long int last_1_var_1_5 = 5;
VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5]
[L178] isInitial = 1
[L179] FCALL initially()
[L180] COND TRUE 1
[L181] CALL updateLastVariables()
[L171] last_1_var_1_5 = var_1_5
VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5]
[L181] RET updateLastVariables()
[L182] CALL updateVariables()
[L137] var_1_9 = __VERIFIER_nondet_float()
[L138] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L138] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L139] var_1_10 = __VERIFIER_nondet_float()
[L140] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L140] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L141] var_1_11 = __VERIFIER_nondet_uchar()
[L142] CALL assume_abort_if_not(var_1_11 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L142] RET assume_abort_if_not(var_1_11 >= 0)
VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L143] CALL assume_abort_if_not(var_1_11 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L143] RET assume_abort_if_not(var_1_11 <= 127)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L144] var_1_12 = __VERIFIER_nondet_uchar()
[L145] CALL assume_abort_if_not(var_1_12 >= 63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L145] RET assume_abort_if_not(var_1_12 >= 63)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L146] CALL assume_abort_if_not(var_1_12 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L146] RET assume_abort_if_not(var_1_12 <= 127)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L147] var_1_13 = __VERIFIER_nondet_uchar()
[L148] CALL assume_abort_if_not(var_1_13 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L148] RET assume_abort_if_not(var_1_13 >= 0)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L149] CALL assume_abort_if_not(var_1_13 <= 63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L149] RET assume_abort_if_not(var_1_13 <= 63)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L150] var_1_14 = __VERIFIER_nondet_uchar()
[L151] CALL assume_abort_if_not(var_1_14 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L151] RET assume_abort_if_not(var_1_14 >= 0)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L152] CALL assume_abort_if_not(var_1_14 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L152] RET assume_abort_if_not(var_1_14 <= 127)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L153] var_1_18 = __VERIFIER_nondet_char()
[L154] CALL assume_abort_if_not(var_1_18 >= -31)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L154] RET assume_abort_if_not(var_1_18 >= -31)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L155] CALL assume_abort_if_not(var_1_18 <= 32)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L155] RET assume_abort_if_not(var_1_18 <= 32)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L156] var_1_19 = __VERIFIER_nondet_char()
[L157] CALL assume_abort_if_not(var_1_19 >= -15)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L157] RET assume_abort_if_not(var_1_19 >= -15)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L158] CALL assume_abort_if_not(var_1_19 <= 16)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L158] RET assume_abort_if_not(var_1_19 <= 16)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L159] var_1_23 = __VERIFIER_nondet_uchar()
[L160] CALL assume_abort_if_not(var_1_23 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L160] RET assume_abort_if_not(var_1_23 >= 0)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L161] CALL assume_abort_if_not(var_1_23 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L161] RET assume_abort_if_not(var_1_23 <= 0)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L162] var_1_33 = __VERIFIER_nondet_ushort()
[L163] CALL assume_abort_if_not(var_1_33 >= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L163] RET assume_abort_if_not(var_1_33 >= 32767)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L164] CALL assume_abort_if_not(var_1_33 <= 65534)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L164] RET assume_abort_if_not(var_1_33 <= 65534)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L165] var_1_40 = __VERIFIER_nondet_double()
[L166] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L166] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0]
[L167] var_1_41 = __VERIFIER_nondet_double()
[L168] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L168] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L182] RET updateVariables()
[L183] CALL step()
[L52] COND FALSE !(var_1_9 > var_1_10)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L55] var_1_20 = var_1_8
[L56] var_1_22 = var_1_23
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L57] COND FALSE !(\read(var_1_22))
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L60] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L61] COND FALSE !(\read(var_1_22))
[L68] var_1_17 = -32
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L70] unsigned long int stepLocal_1 = var_1_20 + var_1_15;
[L71] signed long int stepLocal_0 = var_1_20;
VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L72] COND TRUE stepLocal_1 < -200
VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L73] COND FALSE !(\read(var_1_22))
[L80] var_1_1 = var_1_20
VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L85] signed long int stepLocal_4 = 256;
[L86] unsigned char stepLocal_3 = var_1_22;
[L87] unsigned long int stepLocal_2 = var_1_15;
VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L88] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8)))
VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0]
[L91] COND FALSE !(stepLocal_3 || var_1_22)
[L96] var_1_5 = -10000
VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=-10000, var_1_8=0]
[L99] COND FALSE !(\read(var_1_23))
[L104] var_1_24 = ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))
VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=-10000, var_1_8=0]
[L106] COND TRUE (var_1_20 / var_1_12) < var_1_11
[L107] var_1_29 = var_1_12
VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=-10000, var_1_8=0]
[L111] COND FALSE !(\read(var_1_22))
VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=-10000, var_1_8=0]
[L114] COND TRUE ((((var_1_8) < (var_1_12)) ? (var_1_8) : (var_1_12))) >= var_1_20
[L115] var_1_37 = var_1_8
VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=8, var_1_43=100, var_1_5=-10000, var_1_8=0]
[L117] COND FALSE !((var_1_9 * (var_1_40 - var_1_41)) >= var_1_9)
[L124] var_1_38 = var_1_14
VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=100, var_1_5=-10000, var_1_8=0]
[L126] COND FALSE !(((((var_1_10) > (64.75f)) ? (var_1_10) : (64.75f))) <= var_1_40)
[L133] var_1_43 = var_1_13
VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0]
[L183] RET step()
[L184] CALL, EXPR property()
[L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0]
[L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0]
[L174] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0]
[L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0]
[L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0]
[L174] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0]
[L174-L175] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23))
;
[L184] RET, EXPR property()
[L184] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1256 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1256 mSDsluCounter, 4115 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2526 mSDsCounter, 300 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1541 IncrementalHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 300 mSolverCounterUnsat, 1589 mSDtfsCounter, 1541 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1035occurred in iteration=8, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 470 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 1423 NumberOfCodeBlocks, 1423 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1123 ConstructedInterpolants, 0 QuantifiedInterpolants, 13896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 6080/6080 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 16:47:21,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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_a1c91f98-1db1-4136-8aff-1f046a63234e/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 908ebf0ce710b19ef334a87c76f83c10f178a5493f5ed2ea191592b95f89ac2f
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 16:47:23,611 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 16:47:23,702 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 16:47:23,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 16:47:23,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 16:47:23,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 16:47:23,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 16:47:23,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 16:47:23,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 16:47:23,760 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 16:47:23,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 16:47:23,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 16:47:23,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 16:47:23,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 16:47:23,764 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 16:47:23,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 16:47:23,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 16:47:23,765 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 16:47:23,766 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 16:47:23,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 16:47:23,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 16:47:23,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 16:47:23,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 16:47:23,769 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 16:47:23,770 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 16:47:23,770 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 16:47:23,770 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 16:47:23,771 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 16:47:23,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 16:47:23,772 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 16:47:23,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 16:47:23,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 16:47:23,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 16:47:23,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 16:47:23,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 16:47:23,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 16:47:23,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 16:47:23,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 16:47:23,778 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 16:47:23,778 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 16:47:23,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 16:47:23,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 16:47:23,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 16:47:23,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 16:47:23,781 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_a1c91f98-1db1-4136-8aff-1f046a63234e/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_a1c91f98-1db1-4136-8aff-1f046a63234e/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 -> 908ebf0ce710b19ef334a87c76f83c10f178a5493f5ed2ea191592b95f89ac2f
[2024-11-08 16:47:24,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 16:47:24,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 16:47:24,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 16:47:24,232 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 16:47:24,232 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 16:47:24,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i
Unable to find full path for "g++"
[2024-11-08 16:47:26,248 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 16:47:26,559 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 16:47:26,559 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i
[2024-11-08 16:47:26,577 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/data/9f77b68ab/0052489fb3574eb0b35b8b221a7aebe7/FLAG9161fab6f
[2024-11-08 16:47:26,846 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/data/9f77b68ab/0052489fb3574eb0b35b8b221a7aebe7
[2024-11-08 16:47:26,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 16:47:26,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 16:47:26,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 16:47:26,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 16:47:26,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 16:47:26,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:47:26" (1/1) ...
[2024-11-08 16:47:26,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c88dad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:26, skipping insertion in model container
[2024-11-08 16:47:26,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:47:26" (1/1) ...
[2024-11-08 16:47:26,903 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 16:47:27,111 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_a1c91f98-1db1-4136-8aff-1f046a63234e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i[919,932]
[2024-11-08 16:47:27,201 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 16:47:27,217 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 16:47:27,229 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_a1c91f98-1db1-4136-8aff-1f046a63234e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i[919,932]
[2024-11-08 16:47:27,305 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 16:47:27,343 INFO L204 MainTranslator]: Completed translation
[2024-11-08 16:47:27,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27 WrapperNode
[2024-11-08 16:47:27,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 16:47:27,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 16:47:27,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 16:47:27,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 16:47:27,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (1/1) ...
[2024-11-08 16:47:27,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (1/1) ...
[2024-11-08 16:47:27,421 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168
[2024-11-08 16:47:27,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 16:47:27,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 16:47:27,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 16:47:27,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 16:47:27,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (1/1) ...
[2024-11-08 16:47:27,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (1/1) ...
[2024-11-08 16:47:27,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (1/1) ...
[2024-11-08 16:47:27,471 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 16:47:27,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (1/1) ...
[2024-11-08 16:47:27,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (1/1) ...
[2024-11-08 16:47:27,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (1/1) ...
[2024-11-08 16:47:27,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (1/1) ...
[2024-11-08 16:47:27,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (1/1) ...
[2024-11-08 16:47:27,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (1/1) ...
[2024-11-08 16:47:27,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 16:47:27,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 16:47:27,505 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 16:47:27,506 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 16:47:27,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (1/1) ...
[2024-11-08 16:47:27,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 16:47:27,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:47:27,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 16:47:27,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 16:47:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 16:47:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 16:47:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 16:47:27,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 16:47:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 16:47:27,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 16:47:27,704 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 16:47:27,707 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 16:47:36,451 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2024-11-08 16:47:36,451 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 16:47:36,464 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 16:47:36,464 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 16:47:36,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:47:36 BoogieIcfgContainer
[2024-11-08 16:47:36,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 16:47:36,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 16:47:36,467 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 16:47:36,470 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 16:47:36,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:47:26" (1/3) ...
[2024-11-08 16:47:36,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694dd2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:47:36, skipping insertion in model container
[2024-11-08 16:47:36,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:27" (2/3) ...
[2024-11-08 16:47:36,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694dd2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:47:36, skipping insertion in model container
[2024-11-08 16:47:36,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:47:36" (3/3) ...
[2024-11-08 16:47:36,473 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i
[2024-11-08 16:47:36,490 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 16:47:36,490 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 16:47:36,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 16:47:36,562 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;@16582ea1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 16:47:36,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 16:47:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 16:47:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2024-11-08 16:47:36,586 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:36,587 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:36,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:36,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:36,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1022501164, now seen corresponding path program 1 times
[2024-11-08 16:47:36,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:47:36,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367229055]
[2024-11-08 16:47:36,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:36,608 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 16:47:36,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 16:47:36,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:36,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:37,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 16:47:37,072 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:47:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked.
[2024-11-08 16:47:37,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:47:37,135 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:47:37,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367229055]
[2024-11-08 16:47:37,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367229055] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:37,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:37,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 16:47:37,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96975919]
[2024-11-08 16:47:37,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:37,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 16:47:37,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:47:37,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 16:47:37,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 16:47:37,177 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2024-11-08 16:47:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:47:37,207 INFO L93 Difference]: Finished difference Result 142 states and 246 transitions.
[2024-11-08 16:47:37,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 16:47:37,210 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136
[2024-11-08 16:47:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:47:37,222 INFO L225 Difference]: With dead ends: 142
[2024-11-08 16:47:37,223 INFO L226 Difference]: Without dead ends: 70
[2024-11-08 16:47:37,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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 16:47:37,235 INFO L432 NwaCegarLoop]: 105 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, 105 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 16:47:37,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 16:47:37,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2024-11-08 16:47:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2024-11-08 16:47:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 16:47:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions.
[2024-11-08 16:47:37,297 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 136
[2024-11-08 16:47:37,299 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:47:37,299 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions.
[2024-11-08 16:47:37,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2024-11-08 16:47:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions.
[2024-11-08 16:47:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2024-11-08 16:47:37,306 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:37,306 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:37,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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)] Ended with exit code 0
[2024-11-08 16:47:37,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:37,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:37,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:37,508 INFO L85 PathProgramCache]: Analyzing trace with hash -157539364, now seen corresponding path program 1 times
[2024-11-08 16:47:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:47:37,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350901270]
[2024-11-08 16:47:37,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:37,510 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 16:47:37,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 16:47:37,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:37,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:37,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 16:47:37,936 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:47:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked.
[2024-11-08 16:47:38,492 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 16:47:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked.
[2024-11-08 16:47:39,253 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:47:39,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350901270]
[2024-11-08 16:47:39,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350901270] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 16:47:39,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 16:47:39,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8
[2024-11-08 16:47:39,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369437414]
[2024-11-08 16:47:39,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 16:47:39,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 16:47:39,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:47:39,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 16:47:39,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-11-08 16:47:39,258 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25)
[2024-11-08 16:47:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:47:40,377 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions.
[2024-11-08 16:47:40,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-08 16:47:40,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 136
[2024-11-08 16:47:40,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:47:40,381 INFO L225 Difference]: With dead ends: 142
[2024-11-08 16:47:40,385 INFO L226 Difference]: Without dead ends: 75
[2024-11-08 16:47:40,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210
[2024-11-08 16:47:40,387 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 99 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-08 16:47:40,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 150 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-08 16:47:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2024-11-08 16:47:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71.
[2024-11-08 16:47:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 16:47:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions.
[2024-11-08 16:47:40,414 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 98 transitions. Word has length 136
[2024-11-08 16:47:40,415 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:47:40,416 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 98 transitions.
[2024-11-08 16:47:40,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25)
[2024-11-08 16:47:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 98 transitions.
[2024-11-08 16:47:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2024-11-08 16:47:40,420 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:40,421 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:40,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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)] Ended with exit code 0
[2024-11-08 16:47:40,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:40,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:40,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1739733404, now seen corresponding path program 1 times
[2024-11-08 16:47:40,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:47:40,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028684407]
[2024-11-08 16:47:40,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:40,624 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 16:47:40,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 16:47:40,627 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:40,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:41,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 16:47:41,049 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:47:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2024-11-08 16:47:42,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:47:42,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:47:42,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028684407]
[2024-11-08 16:47:42,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028684407] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:42,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:42,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 16:47:42,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296880909]
[2024-11-08 16:47:42,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:42,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 16:47:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:47:42,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 16:47:42,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 16:47:42,196 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:47:42,945 INFO L93 Difference]: Finished difference Result 183 states and 256 transitions.
[2024-11-08 16:47:42,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 16:47:42,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136
[2024-11-08 16:47:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:47:42,949 INFO L225 Difference]: With dead ends: 183
[2024-11-08 16:47:42,949 INFO L226 Difference]: Without dead ends: 115
[2024-11-08 16:47:42,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-08 16:47:42,951 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 116 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 16:47:42,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 303 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 16:47:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states.
[2024-11-08 16:47:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71.
[2024-11-08 16:47:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 16:47:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions.
[2024-11-08 16:47:42,989 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 136
[2024-11-08 16:47:42,993 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:47:42,993 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions.
[2024-11-08 16:47:42,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions.
[2024-11-08 16:47:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2024-11-08 16:47:42,998 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:42,999 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:43,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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)] Ended with exit code 0
[2024-11-08 16:47:43,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:43,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:43,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash -733945236, now seen corresponding path program 1 times
[2024-11-08 16:47:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:47:43,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864390577]
[2024-11-08 16:47:43,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:43,204 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 16:47:43,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 16:47:43,209 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:43,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:43,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 16:47:43,714 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:47:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2024-11-08 16:47:46,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:47:46,307 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:47:46,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864390577]
[2024-11-08 16:47:46,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864390577] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:46,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:46,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 16:47:46,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120572567]
[2024-11-08 16:47:46,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:46,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 16:47:46,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:47:46,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 16:47:46,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 16:47:46,314 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:47:46,953 INFO L93 Difference]: Finished difference Result 222 states and 304 transitions.
[2024-11-08 16:47:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 16:47:46,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137
[2024-11-08 16:47:46,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:47:46,957 INFO L225 Difference]: With dead ends: 222
[2024-11-08 16:47:46,957 INFO L226 Difference]: Without dead ends: 154
[2024-11-08 16:47:46,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-08 16:47:46,959 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 74 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 16:47:46,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 327 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 16:47:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states.
[2024-11-08 16:47:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 137.
[2024-11-08 16:47:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40)
[2024-11-08 16:47:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 189 transitions.
[2024-11-08 16:47:46,999 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 189 transitions. Word has length 137
[2024-11-08 16:47:46,999 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:47:46,999 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 189 transitions.
[2024-11-08 16:47:47,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-08 16:47:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 189 transitions.
[2024-11-08 16:47:47,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-08 16:47:47,002 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 16:47:47,002 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:47,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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)] Ended with exit code 0
[2024-11-08 16:47:47,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:47,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:47:47,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:47,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1303590533, now seen corresponding path program 1 times
[2024-11-08 16:47:47,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:47:47,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218343038]
[2024-11-08 16:47:47,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:47,206 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 16:47:47,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 16:47:47,210 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:47,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1c91f98-1db1-4136-8aff-1f046a63234e/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 16:47:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:47,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 35 conjuncts are in the unsatisfiable core
[2024-11-08 16:47:47,931 INFO L278 TraceCheckSpWp]: Computing forward predicates...