./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 16:19:53,361 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-08 16:19:53,460 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 16:19:53,468 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 16:19:53,468 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 16:19:53,506 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 16:19:53,508 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 16:19:53,508 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 16:19:53,509 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 16:19:53,514 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-08 16:19:53,514 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 16:19:53,515 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 16:19:53,515 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 16:19:53,516 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-08 16:19:53,516 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-08 16:19:53,516 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 16:19:53,517 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-08 16:19:53,517 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-08 16:19:53,517 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-08 16:19:53,518 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-08 16:19:53,518 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-08 16:19:53,519 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 16:19:53,519 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 16:19:53,519 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 16:19:53,519 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-08 16:19:53,520 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-08 16:19:53,520 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-08 16:19:53,520 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-08 16:19:53,521 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 16:19:53,521 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-08 16:19:53,521 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 16:19:53,521 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-08 16:19:53,522 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 16:19:53,522 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 16:19:53,526 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 16:19:53,527 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 16:19:53,527 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-08 16:19:53,527 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 16:19:53,527 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 16:19:53,528 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 16:19:53,528 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 16:19:53,529 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 16:19:53,529 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_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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 -> 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba
[2024-11-08 16:19:53,829 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 16:19:53,869 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 16:19:53,871 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 16:19:53,873 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-08 16:19:53,873 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-08 16:19:53,874 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i
Unable to find full path for "g++"
[2024-11-08 16:19:55,856 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-08 16:19:56,074 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-08 16:19:56,075 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i
[2024-11-08 16:19:56,085 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/data/f77fac881/687bec0708774eaab7d485d53a1fde3f/FLAG91dcfe512
[2024-11-08 16:19:56,100 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/data/f77fac881/687bec0708774eaab7d485d53a1fde3f
[2024-11-08 16:19:56,103 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 16:19:56,104 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 16:19:56,106 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 16:19:56,106 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 16:19:56,115 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 16:19:56,116 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:19:56" (1/1) ...
[2024-11-08 16:19:56,120 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267f35cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56, skipping insertion in model container
[2024-11-08 16:19:56,120 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:19:56" (1/1) ...
[2024-11-08 16:19:56,162 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-08 16:19:56,343 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_1ce26f41-4b68-4f37-81ed-e4421ea817f8/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i[918,931]
[2024-11-08 16:19:56,408 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 16:19:56,426 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-08 16:19:56,440 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_1ce26f41-4b68-4f37-81ed-e4421ea817f8/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i[918,931]
[2024-11-08 16:19:56,530 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 16:19:56,570 INFO  L204         MainTranslator]: Completed translation
[2024-11-08 16:19:56,570 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56 WrapperNode
[2024-11-08 16:19:56,570 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 16:19:56,571 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 16:19:56,572 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 16:19:56,572 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 16:19:56,579 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:19:56" (1/1) ...
[2024-11-08 16:19:56,593 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:19:56" (1/1) ...
[2024-11-08 16:19:56,648 INFO  L138                Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225
[2024-11-08 16:19:56,649 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 16:19:56,649 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 16:19:56,649 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 16:19:56,650 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 16:19:56,665 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56" (1/1) ...
[2024-11-08 16:19:56,665 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56" (1/1) ...
[2024-11-08 16:19:56,669 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56" (1/1) ...
[2024-11-08 16:19:56,698 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:19:56,699 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56" (1/1) ...
[2024-11-08 16:19:56,699 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56" (1/1) ...
[2024-11-08 16:19:56,708 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56" (1/1) ...
[2024-11-08 16:19:56,719 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56" (1/1) ...
[2024-11-08 16:19:56,722 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56" (1/1) ...
[2024-11-08 16:19:56,728 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56" (1/1) ...
[2024-11-08 16:19:56,736 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 16:19:56,737 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 16:19:56,740 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 16:19:56,741 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-08 16:19:56,742 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56" (1/1) ...
[2024-11-08 16:19:56,748 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 16:19:56,762 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:19:56,782 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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:19:56,789 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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:19:56,817 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 16:19:56,818 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 16:19:56,819 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 16:19:56,819 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 16:19:56,819 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 16:19:56,819 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 16:19:56,931 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-08 16:19:56,935 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 16:19:57,549 INFO  L?                        ?]: Removed 24 outVars from TransFormulas that were not future-live.
[2024-11-08 16:19:57,549 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-08 16:19:57,568 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 16:19:57,568 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 16:19:57,568 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:19:57 BoogieIcfgContainer
[2024-11-08 16:19:57,568 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 16:19:57,571 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 16:19:57,571 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 16:19:57,573 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-08 16:19:57,574 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:19:56" (1/3) ...
[2024-11-08 16:19:57,574 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48404834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:19:57, skipping insertion in model container
[2024-11-08 16:19:57,575 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:56" (2/3) ...
[2024-11-08 16:19:57,575 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48404834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:19:57, skipping insertion in model container
[2024-11-08 16:19:57,575 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:19:57" (3/3) ...
[2024-11-08 16:19:57,576 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i
[2024-11-08 16:19:57,594 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 16:19:57,595 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 16:19:57,672 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 16:19:57,678 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;@28649596, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 16:19:57,678 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 16:19:57,682 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 97 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2024-11-08 16:19:57,700 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2024-11-08 16:19:57,700 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:19:57,701 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:57,703 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:19:57,710 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:19:57,710 INFO  L85        PathProgramCache]: Analyzing trace with hash 1551294431, now seen corresponding path program 1 times
[2024-11-08 16:19:57,722 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:19:57,723 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365992591]
[2024-11-08 16:19:57,723 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:19:57,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:19:57,913 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,229 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:19:58,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,239 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 16:19:58,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,246 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 16:19:58,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,252 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 16:19:58,254 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,258 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 16:19:58,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,269 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 16:19:58,272 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,280 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 16:19:58,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,292 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 16:19:58,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,305 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 16:19:58,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,317 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 16:19:58,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,325 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 16:19:58,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,334 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:19:58,340 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,344 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 16:19:58,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,356 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:19:58,358 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,361 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 16:19:58,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,366 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:19:58,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,371 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-08 16:19:58,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,376 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:19:58,379 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,381 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-08 16:19:58,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:58,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2024-11-08 16:19:58,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:19:58,392 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365992591]
[2024-11-08 16:19:58,392 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365992591] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:19:58,393 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:19:58,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 16:19:58,395 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146133901]
[2024-11-08 16:19:58,395 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:19:58,400 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 16:19:58,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:19:58,428 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 16:19:58,429 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 16:19:58,432 INFO  L87              Difference]: Start difference. First operand  has 97 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand  has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19)
[2024-11-08 16:19:58,488 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:19:58,488 INFO  L93              Difference]: Finished difference Result 187 states and 315 transitions.
[2024-11-08 16:19:58,489 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-08 16:19:58,490 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137
[2024-11-08 16:19:58,491 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:19:58,502 INFO  L225             Difference]: With dead ends: 187
[2024-11-08 16:19:58,502 INFO  L226             Difference]: Without dead ends: 93
[2024-11-08 16:19:58,507 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:19:58,512 INFO  L432           NwaCegarLoop]: 143 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, 143 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:19:58,513 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 16:19:58,533 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2024-11-08 16:19:58,573 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2024-11-08 16:19:58,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 93 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 72 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2024-11-08 16:19:58,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions.
[2024-11-08 16:19:58,583 INFO  L78                 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 137
[2024-11-08 16:19:58,587 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:19:58,587 INFO  L471      AbstractCegarLoop]: Abstraction has 93 states and 143 transitions.
[2024-11-08 16:19:58,588 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19)
[2024-11-08 16:19:58,588 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions.
[2024-11-08 16:19:58,599 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2024-11-08 16:19:58,599 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:19:58,599 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:58,600 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 16:19:58,600 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:19:58,601 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:19:58,601 INFO  L85        PathProgramCache]: Analyzing trace with hash -2144418203, now seen corresponding path program 1 times
[2024-11-08 16:19:58,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:19:58,601 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14572949]
[2024-11-08 16:19:58,602 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:19:58,602 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:19:58,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,026 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:19:59,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,034 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 16:19:59,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,043 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 16:19:59,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,050 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 16:19:59,056 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,059 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 16:19:59,061 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,077 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 16:19:59,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,082 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 16:19:59,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,090 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 16:19:59,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,096 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 16:19:59,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,124 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 16:19:59,130 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,133 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 16:19:59,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,141 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:19:59,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,148 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 16:19:59,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,157 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:19:59,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,162 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 16:19:59,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,170 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:19:59,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,178 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-08 16:19:59,181 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,188 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:19:59,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,195 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-08 16:19:59,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2024-11-08 16:19:59,205 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:19:59,206 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14572949]
[2024-11-08 16:19:59,206 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14572949] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:19:59,206 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:19:59,207 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 16:19:59,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292502344]
[2024-11-08 16:19:59,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:19:59,212 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 16:19:59,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:19:59,213 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 16:19:59,215 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 16:19:59,215 INFO  L87              Difference]: Start difference. First operand 93 states and 143 transitions. Second operand  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:19:59,283 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:19:59,283 INFO  L93              Difference]: Finished difference Result 184 states and 285 transitions.
[2024-11-08 16:19:59,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 16:19:59,284 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137
[2024-11-08 16:19:59,285 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:19:59,287 INFO  L225             Difference]: With dead ends: 184
[2024-11-08 16:19:59,287 INFO  L226             Difference]: Without dead ends: 94
[2024-11-08 16:19:59,290 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:19:59,295 INFO  L432           NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 16:19:59,296 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 16:19:59,300 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2024-11-08 16:19:59,313 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2024-11-08 16:19:59,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2024-11-08 16:19:59,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions.
[2024-11-08 16:19:59,317 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 144 transitions. Word has length 137
[2024-11-08 16:19:59,319 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:19:59,320 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 144 transitions.
[2024-11-08 16:19:59,320 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:19:59,321 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 144 transitions.
[2024-11-08 16:19:59,324 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-08 16:19:59,325 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:19:59,325 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:59,325 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 16:19:59,326 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:19:59,326 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:19:59,327 INFO  L85        PathProgramCache]: Analyzing trace with hash 1356901359, now seen corresponding path program 1 times
[2024-11-08 16:19:59,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:19:59,328 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413149625]
[2024-11-08 16:19:59,328 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:19:59,328 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:19:59,390 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,553 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:19:59,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,559 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 16:19:59,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,564 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 16:19:59,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,571 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 16:19:59,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,576 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 16:19:59,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,582 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 16:19:59,584 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,587 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 16:19:59,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,592 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 16:19:59,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,597 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 16:19:59,599 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,602 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 16:19:59,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,608 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 16:19:59,610 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,615 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:19:59,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,620 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 16:19:59,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,625 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:19:59,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,629 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 16:19:59,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,637 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:19:59,639 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,642 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-08 16:19:59,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,646 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:19:59,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,650 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-08 16:19:59,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:19:59,660 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2024-11-08 16:19:59,660 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:19:59,660 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413149625]
[2024-11-08 16:19:59,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413149625] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:19:59,665 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:19:59,665 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 16:19:59,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301681751]
[2024-11-08 16:19:59,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:19:59,667 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 16:19:59,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:19:59,670 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 16:19:59,671 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 16:19:59,671 INFO  L87              Difference]: Start difference. First operand 94 states and 144 transitions. Second operand  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:19:59,788 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:19:59,788 INFO  L93              Difference]: Finished difference Result 253 states and 387 transitions.
[2024-11-08 16:19:59,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 16:19:59,792 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138
[2024-11-08 16:19:59,793 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:19:59,800 INFO  L225             Difference]: With dead ends: 253
[2024-11-08 16:19:59,800 INFO  L226             Difference]: Without dead ends: 162
[2024-11-08 16:19:59,801 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:19:59,802 INFO  L432           NwaCegarLoop]: 172 mSDtfsCounter, 99 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 16:19:59,806 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 293 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 16:19:59,807 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2024-11-08 16:19:59,845 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159.
[2024-11-08 16:19:59,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 159 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 125 states have internal predecessors, (176), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-08 16:19:59,852 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 240 transitions.
[2024-11-08 16:19:59,856 INFO  L78                 Accepts]: Start accepts. Automaton has 159 states and 240 transitions. Word has length 138
[2024-11-08 16:19:59,857 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:19:59,860 INFO  L471      AbstractCegarLoop]: Abstraction has 159 states and 240 transitions.
[2024-11-08 16:19:59,861 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:19:59,861 INFO  L276                IsEmpty]: Start isEmpty. Operand 159 states and 240 transitions.
[2024-11-08 16:19:59,864 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-08 16:19:59,868 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:19:59,869 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:59,869 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 16:19:59,870 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:19:59,870 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:19:59,870 INFO  L85        PathProgramCache]: Analyzing trace with hash 335833005, now seen corresponding path program 1 times
[2024-11-08 16:19:59,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:19:59,871 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139426869]
[2024-11-08 16:19:59,871 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:19:59,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:20:00,054 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,668 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:20:03,673 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,678 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 16:20:03,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,685 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 16:20:03,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,693 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 16:20:03,695 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,703 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 16:20:03,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,714 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 16:20:03,722 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,739 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 16:20:03,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,761 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 16:20:03,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,787 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 16:20:03,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,805 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 16:20:03,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,833 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 16:20:03,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,856 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:20:03,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,879 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 16:20:03,882 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,901 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:20:03,904 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,926 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 16:20:03,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,951 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:20:03,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,974 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-08 16:20:03,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:03,994 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:20:04,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:04,017 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-08 16:20:04,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:04,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2024-11-08 16:20:04,054 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:20:04,055 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139426869]
[2024-11-08 16:20:04,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139426869] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:20:04,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:20:04,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-08 16:20:04,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697884837]
[2024-11-08 16:20:04,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:20:04,057 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 16:20:04,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:20:04,058 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 16:20:04,059 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2024-11-08 16:20:04,060 INFO  L87              Difference]: Start difference. First operand 159 states and 240 transitions. Second operand  has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19)
[2024-11-08 16:20:07,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:20:07,145 INFO  L93              Difference]: Finished difference Result 571 states and 865 transitions.
[2024-11-08 16:20:07,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-08 16:20:07,146 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 138
[2024-11-08 16:20:07,147 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:20:07,153 INFO  L225             Difference]: With dead ends: 571
[2024-11-08 16:20:07,153 INFO  L226             Difference]: Without dead ends: 415
[2024-11-08 16:20:07,155 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182
[2024-11-08 16:20:07,156 INFO  L432           NwaCegarLoop]: 92 mSDtfsCounter, 507 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2024-11-08 16:20:07,157 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 436 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2024-11-08 16:20:07,159 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 415 states.
[2024-11-08 16:20:07,216 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 384.
[2024-11-08 16:20:07,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 384 states, 315 states have (on average 1.4634920634920634) internal successors, (461), 317 states have internal predecessors, (461), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64)
[2024-11-08 16:20:07,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 589 transitions.
[2024-11-08 16:20:07,222 INFO  L78                 Accepts]: Start accepts. Automaton has 384 states and 589 transitions. Word has length 138
[2024-11-08 16:20:07,223 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:20:07,223 INFO  L471      AbstractCegarLoop]: Abstraction has 384 states and 589 transitions.
[2024-11-08 16:20:07,223 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19)
[2024-11-08 16:20:07,224 INFO  L276                IsEmpty]: Start isEmpty. Operand 384 states and 589 transitions.
[2024-11-08 16:20:07,226 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-08 16:20:07,227 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:20:07,227 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:07,227 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 16:20:07,228 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:20:07,228 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:20:07,229 INFO  L85        PathProgramCache]: Analyzing trace with hash 397872619, now seen corresponding path program 1 times
[2024-11-08 16:20:07,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:20:07,229 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211518554]
[2024-11-08 16:20:07,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:07,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:20:07,281 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,859 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:20:08,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,865 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 16:20:08,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,868 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 16:20:08,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,873 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 16:20:08,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,877 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 16:20:08,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,881 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 16:20:08,883 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,887 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 16:20:08,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,890 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 16:20:08,892 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,893 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 16:20:08,895 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,898 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 16:20:08,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,902 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 16:20:08,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,905 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:20:08,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,910 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 16:20:08,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,914 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:20:08,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,917 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 16:20:08,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,920 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:20:08,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,924 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-08 16:20:08,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,927 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:20:08,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,934 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-08 16:20:08,935 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:08,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2024-11-08 16:20:08,943 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:20:08,943 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211518554]
[2024-11-08 16:20:08,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211518554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:20:08,944 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:20:08,944 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 16:20:08,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096295928]
[2024-11-08 16:20:08,945 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:20:08,945 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 16:20:08,949 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:20:08,950 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 16:20:08,951 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-11-08 16:20:08,951 INFO  L87              Difference]: Start difference. First operand 384 states and 589 transitions. Second operand  has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:20:10,251 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:20:10,252 INFO  L93              Difference]: Finished difference Result 895 states and 1366 transitions.
[2024-11-08 16:20:10,253 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-08 16:20:10,253 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138
[2024-11-08 16:20:10,254 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:20:10,259 INFO  L225             Difference]: With dead ends: 895
[2024-11-08 16:20:10,260 INFO  L226             Difference]: Without dead ends: 514
[2024-11-08 16:20:10,262 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-11-08 16:20:10,264 INFO  L432           NwaCegarLoop]: 139 mSDtfsCounter, 213 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2024-11-08 16:20:10,269 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 480 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-08 16:20:10,271 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 514 states.
[2024-11-08 16:20:10,333 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 388.
[2024-11-08 16:20:10,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 388 states, 319 states have (on average 1.457680250783699) internal successors, (465), 321 states have internal predecessors, (465), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64)
[2024-11-08 16:20:10,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 593 transitions.
[2024-11-08 16:20:10,340 INFO  L78                 Accepts]: Start accepts. Automaton has 388 states and 593 transitions. Word has length 138
[2024-11-08 16:20:10,341 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:20:10,342 INFO  L471      AbstractCegarLoop]: Abstraction has 388 states and 593 transitions.
[2024-11-08 16:20:10,342 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:20:10,342 INFO  L276                IsEmpty]: Start isEmpty. Operand 388 states and 593 transitions.
[2024-11-08 16:20:10,345 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-08 16:20:10,346 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:20:10,346 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:10,346 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 16:20:10,347 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:20:10,347 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:20:10,348 INFO  L85        PathProgramCache]: Analyzing trace with hash 845306095, now seen corresponding path program 1 times
[2024-11-08 16:20:10,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:20:10,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359077842]
[2024-11-08 16:20:10,348 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:10,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:20:10,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,774 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:20:13,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,780 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 16:20:13,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,787 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 16:20:13,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,792 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 16:20:13,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,795 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 16:20:13,796 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,798 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 16:20:13,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,802 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 16:20:13,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,805 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 16:20:13,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,808 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 16:20:13,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,811 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 16:20:13,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,815 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 16:20:13,816 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,818 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:20:13,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,822 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 16:20:13,824 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,826 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:20:13,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,829 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 16:20:13,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,835 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:20:13,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,841 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-08 16:20:13,842 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,844 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:20:13,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,847 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-08 16:20:13,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:13,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2024-11-08 16:20:13,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:20:13,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359077842]
[2024-11-08 16:20:13,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359077842] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:20:13,855 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:20:13,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 16:20:13,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650011107]
[2024-11-08 16:20:13,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:20:13,857 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 16:20:13,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:20:13,859 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 16:20:13,861 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-11-08 16:20:13,861 INFO  L87              Difference]: Start difference. First operand 388 states and 593 transitions. Second operand  has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:20:16,177 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:20:16,178 INFO  L93              Difference]: Finished difference Result 815 states and 1244 transitions.
[2024-11-08 16:20:16,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-08 16:20:16,179 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138
[2024-11-08 16:20:16,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:20:16,187 INFO  L225             Difference]: With dead ends: 815
[2024-11-08 16:20:16,187 INFO  L226             Difference]: Without dead ends: 588
[2024-11-08 16:20:16,188 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-11-08 16:20:16,191 INFO  L432           NwaCegarLoop]: 172 mSDtfsCounter, 213 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2024-11-08 16:20:16,194 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 591 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2024-11-08 16:20:16,195 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 588 states.
[2024-11-08 16:20:16,243 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 390.
[2024-11-08 16:20:16,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 390 states, 321 states have (on average 1.4579439252336448) internal successors, (468), 323 states have internal predecessors, (468), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64)
[2024-11-08 16:20:16,248 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 596 transitions.
[2024-11-08 16:20:16,249 INFO  L78                 Accepts]: Start accepts. Automaton has 390 states and 596 transitions. Word has length 138
[2024-11-08 16:20:16,250 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:20:16,251 INFO  L471      AbstractCegarLoop]: Abstraction has 390 states and 596 transitions.
[2024-11-08 16:20:16,251 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:20:16,252 INFO  L276                IsEmpty]: Start isEmpty. Operand 390 states and 596 transitions.
[2024-11-08 16:20:16,255 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-11-08 16:20:16,255 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:20:16,256 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:16,256 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 16:20:16,256 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:20:16,257 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:20:16,257 INFO  L85        PathProgramCache]: Analyzing trace with hash 366284776, now seen corresponding path program 1 times
[2024-11-08 16:20:16,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:20:16,258 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861197624]
[2024-11-08 16:20:16,258 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:16,259 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:20:16,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,564 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:20:16,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,592 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 16:20:16,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,598 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 16:20:16,599 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,602 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 16:20:16,604 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,607 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 16:20:16,610 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,613 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 16:20:16,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,617 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 16:20:16,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,623 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 16:20:16,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,629 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 16:20:16,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,634 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 16:20:16,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,641 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 16:20:16,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,646 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:20:16,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,651 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 16:20:16,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,658 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:20:16,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,662 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 16:20:16,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,668 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:20:16,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,674 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-08 16:20:16,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,679 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:20:16,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,684 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-08 16:20:16,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked.
[2024-11-08 16:20:16,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:20:16,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861197624]
[2024-11-08 16:20:16,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861197624] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 16:20:16,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970758857]
[2024-11-08 16:20:16,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:16,691 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:20:16,691 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:20:16,694 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:20:16,698 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 16:20:16,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:16,878 INFO  L255         TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-08 16:20:16,894 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:20:17,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2024-11-08 16:20:17,154 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:20:17,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [970758857] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:20:17,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 16:20:17,155 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10
[2024-11-08 16:20:17,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352894796]
[2024-11-08 16:20:17,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:20:17,159 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 16:20:17,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:20:17,162 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 16:20:17,162 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2024-11-08 16:20:17,163 INFO  L87              Difference]: Start difference. First operand 390 states and 596 transitions. Second operand  has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:20:17,580 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:20:17,581 INFO  L93              Difference]: Finished difference Result 1012 states and 1536 transitions.
[2024-11-08 16:20:17,581 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-08 16:20:17,582 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140
[2024-11-08 16:20:17,582 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:20:17,587 INFO  L225             Difference]: With dead ends: 1012
[2024-11-08 16:20:17,588 INFO  L226             Difference]: Without dead ends: 625
[2024-11-08 16:20:17,589 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-11-08 16:20:17,592 INFO  L432           NwaCegarLoop]: 126 mSDtfsCounter, 58 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 16:20:17,593 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 566 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 16:20:17,596 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 625 states.
[2024-11-08 16:20:17,661 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 619.
[2024-11-08 16:20:17,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 619 states, 538 states have (on average 1.4646840148698885) internal successors, (788), 544 states have internal predecessors, (788), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72)
[2024-11-08 16:20:17,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 932 transitions.
[2024-11-08 16:20:17,668 INFO  L78                 Accepts]: Start accepts. Automaton has 619 states and 932 transitions. Word has length 140
[2024-11-08 16:20:17,668 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:20:17,669 INFO  L471      AbstractCegarLoop]: Abstraction has 619 states and 932 transitions.
[2024-11-08 16:20:17,669 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:20:17,669 INFO  L276                IsEmpty]: Start isEmpty. Operand 619 states and 932 transitions.
[2024-11-08 16:20:17,672 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-11-08 16:20:17,672 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:20:17,672 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:17,701 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-08 16:20:17,876 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:20:17,878 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:20:17,878 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:20:17,878 INFO  L85        PathProgramCache]: Analyzing trace with hash 64519496, now seen corresponding path program 1 times
[2024-11-08 16:20:17,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:20:17,879 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737623866]
[2024-11-08 16:20:17,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:17,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:20:17,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,153 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:20:18,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,181 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 16:20:18,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,186 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 16:20:18,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,190 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 16:20:18,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,194 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 16:20:18,196 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,200 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 16:20:18,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,206 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 16:20:18,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,210 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 16:20:18,213 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,217 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 16:20:18,219 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,221 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 16:20:18,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,226 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 16:20:18,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,230 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:20:18,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,234 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 16:20:18,236 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,239 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:20:18,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,244 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 16:20:18,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,251 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:20:18,253 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,256 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-08 16:20:18,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,263 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:20:18,265 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,268 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-08 16:20:18,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,273 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked.
[2024-11-08 16:20:18,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:20:18,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737623866]
[2024-11-08 16:20:18,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737623866] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 16:20:18,274 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801491122]
[2024-11-08 16:20:18,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:18,274 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:20:18,274 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:20:18,277 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:20:18,279 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 16:20:18,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:18,465 INFO  L255         TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-08 16:20:18,471 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:20:19,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 242 proven. 54 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked.
[2024-11-08 16:20:19,030 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 16:20:19,348 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked.
[2024-11-08 16:20:19,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [801491122] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 16:20:19,349 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 16:20:19,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11
[2024-11-08 16:20:19,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328887717]
[2024-11-08 16:20:19,350 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 16:20:19,351 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 16:20:19,351 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:20:19,352 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 16:20:19,352 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2024-11-08 16:20:19,353 INFO  L87              Difference]: Start difference. First operand 619 states and 932 transitions. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 5 states have call predecessors, (56), 6 states have call successors, (56)
[2024-11-08 16:20:19,832 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:20:19,832 INFO  L93              Difference]: Finished difference Result 1291 states and 1905 transitions.
[2024-11-08 16:20:19,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-11-08 16:20:19,834 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 5 states have call predecessors, (56), 6 states have call successors, (56) Word has length 140
[2024-11-08 16:20:19,834 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:20:19,839 INFO  L225             Difference]: With dead ends: 1291
[2024-11-08 16:20:19,839 INFO  L226             Difference]: Without dead ends: 675
[2024-11-08 16:20:19,841 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240
[2024-11-08 16:20:19,842 INFO  L432           NwaCegarLoop]: 87 mSDtfsCounter, 337 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 16:20:19,842 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 225 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 16:20:19,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 675 states.
[2024-11-08 16:20:19,908 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 667.
[2024-11-08 16:20:19,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 667 states, 574 states have (on average 1.4303135888501741) internal successors, (821), 580 states have internal predecessors, (821), 72 states have call successors, (72), 20 states have call predecessors, (72), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72)
[2024-11-08 16:20:19,917 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 965 transitions.
[2024-11-08 16:20:19,918 INFO  L78                 Accepts]: Start accepts. Automaton has 667 states and 965 transitions. Word has length 140
[2024-11-08 16:20:19,918 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:20:19,919 INFO  L471      AbstractCegarLoop]: Abstraction has 667 states and 965 transitions.
[2024-11-08 16:20:19,919 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 5 states have call predecessors, (56), 6 states have call successors, (56)
[2024-11-08 16:20:19,919 INFO  L276                IsEmpty]: Start isEmpty. Operand 667 states and 965 transitions.
[2024-11-08 16:20:19,923 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-11-08 16:20:19,923 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:20:19,923 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:19,951 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 16:20:20,127 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7
[2024-11-08 16:20:20,129 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:20:20,131 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:20:20,131 INFO  L85        PathProgramCache]: Analyzing trace with hash 205068106, now seen corresponding path program 1 times
[2024-11-08 16:20:20,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:20:20,132 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549359284]
[2024-11-08 16:20:20,132 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:20,132 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:20:20,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-08 16:20:20,244 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471704560]
[2024-11-08 16:20:20,244 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:20,244 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:20:20,245 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:20:20,247 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:20:20,250 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 16:20:20,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:20,648 INFO  L255         TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 16:20:20,653 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:20:21,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 250 proven. 42 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked.
[2024-11-08 16:20:21,021 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 16:20:21,481 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked.
[2024-11-08 16:20:21,482 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:20:21,482 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549359284]
[2024-11-08 16:20:21,483 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-08 16:20:21,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471704560]
[2024-11-08 16:20:21,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471704560] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 16:20:21,483 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 16:20:21,484 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16
[2024-11-08 16:20:21,484 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413502469]
[2024-11-08 16:20:21,484 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 16:20:21,485 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-08 16:20:21,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:20:21,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-08 16:20:21,486 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240
[2024-11-08 16:20:21,487 INFO  L87              Difference]: Start difference. First operand 667 states and 965 transitions. Second operand  has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2024-11-08 16:20:23,538 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:20:23,538 INFO  L93              Difference]: Finished difference Result 2140 states and 3075 transitions.
[2024-11-08 16:20:23,539 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-11-08 16:20:23,539 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 140
[2024-11-08 16:20:23,540 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:20:23,551 INFO  L225             Difference]: With dead ends: 2140
[2024-11-08 16:20:23,551 INFO  L226             Difference]: Without dead ends: 1476
[2024-11-08 16:20:23,553 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650
[2024-11-08 16:20:23,554 INFO  L432           NwaCegarLoop]: 204 mSDtfsCounter, 346 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2024-11-08 16:20:23,554 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1594 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2024-11-08 16:20:23,558 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1476 states.
[2024-11-08 16:20:23,627 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1046.
[2024-11-08 16:20:23,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1046 states, 965 states have (on average 1.5243523316062175) internal successors, (1471), 967 states have internal predecessors, (1471), 64 states have call successors, (64), 16 states have call predecessors, (64), 16 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64)
[2024-11-08 16:20:23,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1599 transitions.
[2024-11-08 16:20:23,636 INFO  L78                 Accepts]: Start accepts. Automaton has 1046 states and 1599 transitions. Word has length 140
[2024-11-08 16:20:23,639 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:20:23,639 INFO  L471      AbstractCegarLoop]: Abstraction has 1046 states and 1599 transitions.
[2024-11-08 16:20:23,639 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2024-11-08 16:20:23,640 INFO  L276                IsEmpty]: Start isEmpty. Operand 1046 states and 1599 transitions.
[2024-11-08 16:20:23,642 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-11-08 16:20:23,643 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:20:23,643 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:23,669 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-08 16:20:23,843 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:20:23,844 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:20:23,844 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:20:23,844 INFO  L85        PathProgramCache]: Analyzing trace with hash 67556179, now seen corresponding path program 1 times
[2024-11-08 16:20:23,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:20:23,845 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12380040]
[2024-11-08 16:20:23,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:23,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:20:23,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,937 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:20:23,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,940 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 16:20:23,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,943 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 16:20:23,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,945 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 16:20:23,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,948 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 16:20:23,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,950 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 16:20:23,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,953 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 16:20:23,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,959 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 16:20:23,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,965 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 16:20:23,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,968 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 16:20:23,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,970 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 16:20:23,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,973 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:20:23,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,976 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 16:20:23,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,980 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:20:23,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,982 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 16:20:23,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,986 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:20:23,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,989 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-08 16:20:23,990 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,991 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:20:23,994 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,995 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-08 16:20:23,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:23,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2024-11-08 16:20:23,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:20:23,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12380040]
[2024-11-08 16:20:23,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12380040] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:20:23,999 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:20:24,000 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 16:20:24,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912899932]
[2024-11-08 16:20:24,000 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:20:24,000 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 16:20:24,001 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:20:24,001 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 16:20:24,002 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 16:20:24,002 INFO  L87              Difference]: Start difference. First operand 1046 states and 1599 transitions. Second operand  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:20:24,327 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:20:24,327 INFO  L93              Difference]: Finished difference Result 2287 states and 3449 transitions.
[2024-11-08 16:20:24,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 16:20:24,328 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140
[2024-11-08 16:20:24,331 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:20:24,340 INFO  L225             Difference]: With dead ends: 2287
[2024-11-08 16:20:24,341 INFO  L226             Difference]: Without dead ends: 1244
[2024-11-08 16:20:24,343 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:20:24,344 INFO  L432           NwaCegarLoop]: 155 mSDtfsCounter, 116 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 16:20:24,345 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 272 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 16:20:24,348 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1244 states.
[2024-11-08 16:20:24,422 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1046.
[2024-11-08 16:20:24,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1046 states, 965 states have (on average 1.5202072538860103) internal successors, (1467), 967 states have internal predecessors, (1467), 64 states have call successors, (64), 16 states have call predecessors, (64), 16 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64)
[2024-11-08 16:20:24,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1595 transitions.
[2024-11-08 16:20:24,432 INFO  L78                 Accepts]: Start accepts. Automaton has 1046 states and 1595 transitions. Word has length 140
[2024-11-08 16:20:24,433 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:20:24,433 INFO  L471      AbstractCegarLoop]: Abstraction has 1046 states and 1595 transitions.
[2024-11-08 16:20:24,433 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:20:24,434 INFO  L276                IsEmpty]: Start isEmpty. Operand 1046 states and 1595 transitions.
[2024-11-08 16:20:24,437 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2024-11-08 16:20:24,438 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:20:24,438 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:24,438 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-08 16:20:24,439 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:20:24,439 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:20:24,439 INFO  L85        PathProgramCache]: Analyzing trace with hash -685871467, now seen corresponding path program 1 times
[2024-11-08 16:20:24,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:20:24,440 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462429692]
[2024-11-08 16:20:24,440 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:24,440 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:20:24,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:28,965 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:20:28,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:28,969 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 16:20:28,971 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:28,972 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 16:20:28,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:28,976 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 16:20:28,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:28,979 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 16:20:28,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:28,981 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 16:20:28,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:28,985 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 16:20:28,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:28,988 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 16:20:28,990 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:28,991 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 16:20:28,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:28,994 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 16:20:28,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:28,998 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 16:20:28,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:29,001 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:20:29,002 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:29,004 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 16:20:29,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:29,007 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:20:29,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:29,010 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 16:20:29,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:29,014 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:20:29,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:29,017 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-08 16:20:29,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:29,020 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:20:29,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:29,023 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-08 16:20:29,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:29,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2024-11-08 16:20:29,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:20:29,028 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462429692]
[2024-11-08 16:20:29,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462429692] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:20:29,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:20:29,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2024-11-08 16:20:29,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852710317]
[2024-11-08 16:20:29,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:20:29,030 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-08 16:20:29,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:20:29,031 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-08 16:20:29,031 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240
[2024-11-08 16:20:29,032 INFO  L87              Difference]: Start difference. First operand 1046 states and 1595 transitions. Second operand  has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:20:34,299 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:20:34,300 INFO  L93              Difference]: Finished difference Result 3084 states and 4691 transitions.
[2024-11-08 16:20:34,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2024-11-08 16:20:34,301 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141
[2024-11-08 16:20:34,301 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:20:34,310 INFO  L225             Difference]: With dead ends: 3084
[2024-11-08 16:20:34,311 INFO  L226             Difference]: Without dead ends: 2041
[2024-11-08 16:20:34,313 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552
[2024-11-08 16:20:34,314 INFO  L432           NwaCegarLoop]: 125 mSDtfsCounter, 723 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2024-11-08 16:20:34,315 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1223 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2024-11-08 16:20:34,317 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2041 states.
[2024-11-08 16:20:34,405 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 1380.
[2024-11-08 16:20:34,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1380 states, 1299 states have (on average 1.5242494226327945) internal successors, (1980), 1301 states have internal predecessors, (1980), 64 states have call successors, (64), 16 states have call predecessors, (64), 16 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64)
[2024-11-08 16:20:34,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2108 transitions.
[2024-11-08 16:20:34,416 INFO  L78                 Accepts]: Start accepts. Automaton has 1380 states and 2108 transitions. Word has length 141
[2024-11-08 16:20:34,416 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:20:34,416 INFO  L471      AbstractCegarLoop]: Abstraction has 1380 states and 2108 transitions.
[2024-11-08 16:20:34,417 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:20:34,417 INFO  L276                IsEmpty]: Start isEmpty. Operand 1380 states and 2108 transitions.
[2024-11-08 16:20:34,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2024-11-08 16:20:34,422 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:20:34,422 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:34,422 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-08 16:20:34,423 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:20:34,423 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:20:34,423 INFO  L85        PathProgramCache]: Analyzing trace with hash 1425325252, now seen corresponding path program 1 times
[2024-11-08 16:20:34,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:20:34,424 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082317549]
[2024-11-08 16:20:34,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:34,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:20:34,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,532 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 16:20:34,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,535 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 16:20:34,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,539 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 16:20:34,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,541 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 16:20:34,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,544 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 16:20:34,546 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,547 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 16:20:34,548 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,550 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 16:20:34,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,554 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 16:20:34,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,557 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 16:20:34,558 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,560 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 16:20:34,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,563 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 16:20:34,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,566 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 16:20:34,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,568 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 16:20:34,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,571 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 16:20:34,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,573 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 16:20:34,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,576 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-08 16:20:34,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,579 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-08 16:20:34,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,582 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-08 16:20:34,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,584 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-08 16:20:34,588 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:34,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2024-11-08 16:20:34,591 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:20:34,591 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082317549]
[2024-11-08 16:20:34,591 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082317549] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:20:34,592 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:20:34,592 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 16:20:34,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235194157]
[2024-11-08 16:20:34,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:20:34,593 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 16:20:34,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:20:34,594 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 16:20:34,594 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 16:20:34,594 INFO  L87              Difference]: Start difference. First operand 1380 states and 2108 transitions. Second operand  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:20:34,835 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:20:34,835 INFO  L93              Difference]: Finished difference Result 3101 states and 4746 transitions.
[2024-11-08 16:20:34,836 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 16:20:34,836 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141
[2024-11-08 16:20:34,837 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:20:34,846 INFO  L225             Difference]: With dead ends: 3101
[2024-11-08 16:20:34,846 INFO  L226             Difference]: Without dead ends: 1724
[2024-11-08 16:20:34,849 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:20:34,850 INFO  L432           NwaCegarLoop]: 131 mSDtfsCounter, 51 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 16:20:34,850 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 244 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 16:20:34,853 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1724 states.
[2024-11-08 16:20:34,940 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1464.
[2024-11-08 16:20:34,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1464 states, 1383 states have (on average 1.5213304410701374) internal successors, (2104), 1385 states have internal predecessors, (2104), 64 states have call successors, (64), 16 states have call predecessors, (64), 16 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64)
[2024-11-08 16:20:34,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2232 transitions.
[2024-11-08 16:20:34,952 INFO  L78                 Accepts]: Start accepts. Automaton has 1464 states and 2232 transitions. Word has length 141
[2024-11-08 16:20:34,952 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:20:34,952 INFO  L471      AbstractCegarLoop]: Abstraction has 1464 states and 2232 transitions.
[2024-11-08 16:20:34,953 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2024-11-08 16:20:34,953 INFO  L276                IsEmpty]: Start isEmpty. Operand 1464 states and 2232 transitions.
[2024-11-08 16:20:34,957 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2024-11-08 16:20:34,958 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:20:34,958 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:34,958 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-08 16:20:34,959 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:20:34,959 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:20:34,959 INFO  L85        PathProgramCache]: Analyzing trace with hash -486733035, now seen corresponding path program 1 times
[2024-11-08 16:20:34,960 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:20:34,960 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957032352]
[2024-11-08 16:20:34,960 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:34,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:20:35,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-08 16:20:35,099 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1952954674]
[2024-11-08 16:20:35,100 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:35,100 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:20:35,100 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:20:35,102 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:20:35,105 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-08 16:20:35,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:35,319 INFO  L255         TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 16:20:35,325 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:20:35,992 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 288 proven. 39 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked.
[2024-11-08 16:20:35,993 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 16:20:46,990 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~var_1_6~0 c_~var_1_6~0))) (and (forall ((v_z_31 Int)) (or (< .cse0 v_z_31) (= v_z_31 0) (< v_z_31 0) (< (div v_z_31 c_~var_1_6~0) v_z_31) (< 255 v_z_31))) (or (< c_~var_1_6~0 (+ (mod c_~last_1_var_1_12~0 65536) 1 c_~var_1_7~0)) (and (forall ((v_z_28 Int)) (or (< .cse0 v_z_28) (< v_z_28 0) (< (div v_z_28 c_~var_1_6~0) v_z_28))) (forall ((v_z_26 Int)) (or (< v_z_26 0) (< c_~var_1_6~0 (+ v_z_26 1)) (< (div v_z_26 c_~var_1_6~0) v_z_26))) (<= (+ 1 .cse0) c_~var_1_6~0))) (or (< .cse0 1) (< .cse0 c_~var_1_6~0)))) is different from false
[2024-11-08 16:20:48,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked.
[2024-11-08 16:20:48,739 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:20:48,740 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957032352]
[2024-11-08 16:20:48,740 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-08 16:20:48,740 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952954674]
[2024-11-08 16:20:48,740 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952954674] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 16:20:48,740 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 16:20:48,741 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17
[2024-11-08 16:20:48,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351209177]
[2024-11-08 16:20:48,741 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 16:20:48,742 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-11-08 16:20:48,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:20:48,743 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-11-08 16:20:48,743 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=176, Unknown=2, NotChecked=28, Total=272
[2024-11-08 16:20:48,744 INFO  L87              Difference]: Start difference. First operand 1464 states and 2232 transitions. Second operand  has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33)
[2024-11-08 16:20:54,909 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~last_1_var_1_12~0 65536)) (.cse1 (div c_~var_1_6~0 c_~var_1_6~0))) (and (<= c_~var_1_6~0 (+ .cse0 c_~var_1_7~0)) (forall ((v_z_31 Int)) (or (< .cse1 v_z_31) (= v_z_31 0) (< v_z_31 0) (< (div v_z_31 c_~var_1_6~0) v_z_31) (< 255 v_z_31))) (or (< c_~var_1_6~0 (+ .cse0 1 c_~var_1_7~0)) (and (forall ((v_z_28 Int)) (or (< .cse1 v_z_28) (< v_z_28 0) (< (div v_z_28 c_~var_1_6~0) v_z_28))) (forall ((v_z_26 Int)) (or (< v_z_26 0) (< c_~var_1_6~0 (+ v_z_26 1)) (< (div v_z_26 c_~var_1_6~0) v_z_26))) (<= (+ 1 .cse1) c_~var_1_6~0))) (or (< .cse1 1) (< .cse1 c_~var_1_6~0)) (<= 6 c_~var_1_6~0))) is different from false
[2024-11-08 16:20:58,031 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:20:58,035 INFO  L93              Difference]: Finished difference Result 3871 states and 5817 transitions.
[2024-11-08 16:20:58,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2024-11-08 16:20:58,037 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 141
[2024-11-08 16:20:58,038 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:20:58,049 INFO  L225             Difference]: With dead ends: 3871
[2024-11-08 16:20:58,050 INFO  L226             Difference]: Without dead ends: 2368
[2024-11-08 16:20:58,054 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=139, Invalid=372, Unknown=3, NotChecked=86, Total=600
[2024-11-08 16:20:58,055 INFO  L432           NwaCegarLoop]: 121 mSDtfsCounter, 726 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time
[2024-11-08 16:20:58,055 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 827 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 683 Invalid, 0 Unknown, 313 Unchecked, 4.5s Time]
[2024-11-08 16:20:58,058 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2368 states.
[2024-11-08 16:20:58,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 1847.
[2024-11-08 16:20:58,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1847 states, 1762 states have (on average 1.489216799091941) internal successors, (2624), 1764 states have internal predecessors, (2624), 64 states have call successors, (64), 20 states have call predecessors, (64), 20 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64)
[2024-11-08 16:20:58,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2752 transitions.
[2024-11-08 16:20:58,167 INFO  L78                 Accepts]: Start accepts. Automaton has 1847 states and 2752 transitions. Word has length 141
[2024-11-08 16:20:58,168 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:20:58,168 INFO  L471      AbstractCegarLoop]: Abstraction has 1847 states and 2752 transitions.
[2024-11-08 16:20:58,168 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33)
[2024-11-08 16:20:58,169 INFO  L276                IsEmpty]: Start isEmpty. Operand 1847 states and 2752 transitions.
[2024-11-08 16:20:58,173 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2024-11-08 16:20:58,173 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:20:58,173 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:58,201 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-08 16:20:58,374 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2024-11-08 16:20:58,375 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:20:58,376 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:20:58,376 INFO  L85        PathProgramCache]: Analyzing trace with hash -1507801389, now seen corresponding path program 1 times
[2024-11-08 16:20:58,376 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:20:58,376 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137646313]
[2024-11-08 16:20:58,377 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:58,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:20:58,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-08 16:20:58,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127178997]
[2024-11-08 16:20:58,462 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:20:58,462 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:20:58,462 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:20:58,464 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:20:58,466 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-08 16:20:59,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:20:59,400 INFO  L255         TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 19 conjuncts are in the unsatisfiable core
[2024-11-08 16:20:59,403 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:21:03,279 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked.
[2024-11-08 16:21:03,280 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 16:21:06,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:21:06,209 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137646313]
[2024-11-08 16:21:06,209 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-08 16:21:06,210 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127178997]
[2024-11-08 16:21:06,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [127178997] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 16:21:06,210 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2024-11-08 16:21:06,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2024-11-08 16:21:06,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058998510]
[2024-11-08 16:21:06,210 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2024-11-08 16:21:06,211 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-08 16:21:06,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:21:06,213 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 16:21:06,213 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210
[2024-11-08 16:21:06,213 INFO  L87              Difference]: Start difference. First operand 1847 states and 2752 transitions. Second operand  has 10 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19)
[2024-11-08 16:21:08,594 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:21:08,595 INFO  L93              Difference]: Finished difference Result 3666 states and 5465 transitions.
[2024-11-08 16:21:08,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-11-08 16:21:08,597 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 141
[2024-11-08 16:21:08,597 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:21:08,606 INFO  L225             Difference]: With dead ends: 3666
[2024-11-08 16:21:08,606 INFO  L226             Difference]: Without dead ends: 1822
[2024-11-08 16:21:08,610 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600
[2024-11-08 16:21:08,611 INFO  L432           NwaCegarLoop]: 97 mSDtfsCounter, 281 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2024-11-08 16:21:08,611 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 488 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2024-11-08 16:21:08,613 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1822 states.
[2024-11-08 16:21:08,678 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1234.
[2024-11-08 16:21:08,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1234 states, 1165 states have (on average 1.482403433476395) internal successors, (1727), 1166 states have internal predecessors, (1727), 51 states have call successors, (51), 17 states have call predecessors, (51), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51)
[2024-11-08 16:21:08,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1829 transitions.
[2024-11-08 16:21:08,687 INFO  L78                 Accepts]: Start accepts. Automaton has 1234 states and 1829 transitions. Word has length 141
[2024-11-08 16:21:08,688 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:21:08,688 INFO  L471      AbstractCegarLoop]: Abstraction has 1234 states and 1829 transitions.
[2024-11-08 16:21:08,688 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19)
[2024-11-08 16:21:08,688 INFO  L276                IsEmpty]: Start isEmpty. Operand 1234 states and 1829 transitions.
[2024-11-08 16:21:08,691 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2024-11-08 16:21:08,692 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:21:08,692 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:08,721 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-11-08 16:21:08,893 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-11-08 16:21:08,893 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:21:08,894 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:21:08,894 INFO  L85        PathProgramCache]: Analyzing trace with hash 2085566033, now seen corresponding path program 1 times
[2024-11-08 16:21:08,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:21:08,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655949017]
[2024-11-08 16:21:08,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:21:08,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:21:09,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-08 16:21:09,019 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113991990]
[2024-11-08 16:21:09,020 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:21:09,020 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:21:09,020 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:21:09,022 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:21:09,024 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-08 16:21:09,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 16:21:09,294 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 16:21:09,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 16:21:09,519 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 16:21:09,520 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-08 16:21:09,521 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 16:21:09,534 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-08 16:21:09,724 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-11-08 16:21:09,729 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:21:09,899 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 16:21:09,903 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:21:09 BoogieIcfgContainer
[2024-11-08 16:21:09,903 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 16:21:09,904 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 16:21:09,904 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-08 16:21:09,904 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-08 16:21:09,905 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:19:57" (3/4) ...
[2024-11-08 16:21:09,909 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-08 16:21:09,910 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 16:21:09,911 INFO  L158              Benchmark]: Toolchain (without parser) took 73806.96ms. Allocated memory was 125.8MB in the beginning and 352.3MB in the end (delta: 226.5MB). Free memory was 75.3MB in the beginning and 262.6MB in the end (delta: -187.3MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB.
[2024-11-08 16:21:09,912 INFO  L158              Benchmark]: CDTParser took 0.27ms. Allocated memory is still 125.8MB. Free memory was 99.8MB in the beginning and 99.7MB in the end (delta: 139.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 16:21:09,913 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 464.97ms. Allocated memory was 125.8MB in the beginning and 159.4MB in the end (delta: 33.6MB). Free memory was 75.2MB in the beginning and 128.2MB in the end (delta: -53.1MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB.
[2024-11-08 16:21:09,914 INFO  L158              Benchmark]: Boogie Procedure Inliner took 77.31ms. Allocated memory is still 159.4MB. Free memory was 128.2MB in the beginning and 124.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 16:21:09,914 INFO  L158              Benchmark]: Boogie Preprocessor took 87.03ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 120.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 16:21:09,914 INFO  L158              Benchmark]: RCFGBuilder took 831.65ms. Allocated memory is still 159.4MB. Free memory was 120.4MB in the beginning and 93.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2024-11-08 16:21:09,915 INFO  L158              Benchmark]: TraceAbstraction took 72332.80ms. Allocated memory was 159.4MB in the beginning and 352.3MB in the end (delta: 192.9MB). Free memory was 92.0MB in the beginning and 262.6MB in the end (delta: -170.6MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB.
[2024-11-08 16:21:09,916 INFO  L158              Benchmark]: Witness Printer took 6.69ms. Allocated memory is still 352.3MB. Free memory is still 262.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 16:21:09,918 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.27ms. Allocated memory is still 125.8MB. Free memory was 99.8MB in the beginning and 99.7MB in the end (delta: 139.6kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 464.97ms. Allocated memory was 125.8MB in the beginning and 159.4MB in the end (delta: 33.6MB). Free memory was 75.2MB in the beginning and 128.2MB in the end (delta: -53.1MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 77.31ms. Allocated memory is still 159.4MB. Free memory was 128.2MB in the beginning and 124.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 87.03ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 120.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 831.65ms. Allocated memory is still 159.4MB. Free memory was 120.4MB in the beginning and 93.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 72332.80ms. Allocated memory was 159.4MB in the beginning and 352.3MB in the end (delta: 192.9MB). Free memory was 92.0MB in the beginning and 262.6MB in the end (delta: -170.6MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB.
 * Witness Printer took 6.69ms. Allocated memory is still 352.3MB. Free memory is still 262.6MB. 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 161, overapproximation of shiftLeft at line 169, overapproximation of someUnaryDOUBLEoperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 169. 
Possible FailurePath: 
[L21]                    unsigned char isInitial = 0;
[L22]                    double var_1_1 = 5.5;
[L23]                    signed short int var_1_3 = 1;
[L24]                    signed long int var_1_5 = -64;
[L25]                    signed char var_1_6 = 10;
[L26]                    signed char var_1_7 = 5;
[L27]                    double var_1_8 = 16.25;
[L28]                    double var_1_9 = 1.8;
[L29]                    unsigned char var_1_10 = 32;
[L30]                    unsigned char var_1_11 = 64;
[L31]                    unsigned short int var_1_12 = 16;
[L32]                    unsigned long int var_1_13 = 128;
[L33]                    unsigned char var_1_15 = 1;
[L34]                    unsigned short int var_1_16 = 256;
[L35]                    signed char var_1_18 = -2;
[L36]                    unsigned long int var_1_19 = 50;
[L37]                    unsigned char var_1_23 = 64;
[L38]                    unsigned short int var_1_26 = 32;
[L39]                    unsigned short int var_1_28 = 64;
[L40]                    float var_1_30 = -0.2;
[L41]                    float var_1_32 = -0.375;
[L42]                    float var_1_33 = 1.4;
[L43]                    float var_1_35 = 1.5;
[L44]                    unsigned char last_1_var_1_10 = 32;
[L45]                    unsigned short int last_1_var_1_12 = 16;
[L46]                    unsigned long int last_1_var_1_13 = 128;
             VAL         [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L173]                   isInitial = 1
[L174]       FCALL       initially()
[L175]       COND TRUE   1
[L176]       CALL        updateLastVariables()
[L164]                   last_1_var_1_10 = var_1_10
[L165]                   last_1_var_1_12 = var_1_12
[L166]                   last_1_var_1_13 = var_1_13
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L176]       RET         updateLastVariables()
[L177]       CALL        updateVariables()
[L133]                   var_1_3 = __VERIFIER_nondet_short()
[L134]       CALL        assume_abort_if_not(var_1_3 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L134]       RET         assume_abort_if_not(var_1_3 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L135]       CALL        assume_abort_if_not(var_1_3 <= 8)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L135]       RET         assume_abort_if_not(var_1_3 <= 8)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L136]                   var_1_5 = __VERIFIER_nondet_long()
[L137]       CALL        assume_abort_if_not(var_1_5 >= -2147483648)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L137]       RET         assume_abort_if_not(var_1_5 >= -2147483648)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L138]       CALL        assume_abort_if_not(var_1_5 <= 2147483647)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L138]       RET         assume_abort_if_not(var_1_5 <= 2147483647)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L139]       CALL        assume_abort_if_not(var_1_5 != 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L139]       RET         assume_abort_if_not(var_1_5 != 0)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L140]                   var_1_6 = __VERIFIER_nondet_char()
[L141]       CALL        assume_abort_if_not(var_1_6 >= 6)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L141]       RET         assume_abort_if_not(var_1_6 >= 6)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L142]       CALL        assume_abort_if_not(var_1_6 <= 12)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L142]       RET         assume_abort_if_not(var_1_6 <= 12)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L143]                   var_1_7 = __VERIFIER_nondet_char()
[L144]       CALL        assume_abort_if_not(var_1_7 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5]
[L144]       RET         assume_abort_if_not(var_1_7 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5]
[L145]       CALL        assume_abort_if_not(var_1_7 <= 6)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5]
[L145]       RET         assume_abort_if_not(var_1_7 <= 6)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5]
[L146]                   var_1_8 = __VERIFIER_nondet_double()
[L147]       CALL        assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_9=9/5]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_9=9/5]
[L147]       RET         assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_9=9/5]
[L148]                   var_1_9 = __VERIFIER_nondet_double()
[L149]       CALL        assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L149]       RET         assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L150]                   var_1_11 = __VERIFIER_nondet_uchar()
[L151]       CALL        assume_abort_if_not(var_1_11 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L151]       RET         assume_abort_if_not(var_1_11 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L152]       CALL        assume_abort_if_not(var_1_11 <= 254)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L152]       RET         assume_abort_if_not(var_1_11 <= 254)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L153]                   var_1_15 = __VERIFIER_nondet_uchar()
[L154]       CALL        assume_abort_if_not(var_1_15 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L154]       RET         assume_abort_if_not(var_1_15 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L155]       CALL        assume_abort_if_not(var_1_15 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L155]       RET         assume_abort_if_not(var_1_15 <= 1)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L156]                   var_1_30 = __VERIFIER_nondet_float()
[L157]       CALL        assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L157]       RET         assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L158]       CALL        assume_abort_if_not(var_1_30 != 0.0F)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L158]       RET         assume_abort_if_not(var_1_30 != 0.0F)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L159]                   var_1_32 = __VERIFIER_nondet_float()
[L160]       CALL        assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L160]       RET         assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L161]       CALL        assume_abort_if_not(var_1_32 != 0.0F)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L161]       RET         assume_abort_if_not(var_1_32 != 0.0F)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L177]       RET         updateVariables()
[L178]       CALL        step()
[L50]        COND TRUE   ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10
[L51]                    var_1_12 = var_1_6
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L53]                    signed long int stepLocal_2 = last_1_var_1_12 + var_1_7;
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=7, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L54]        COND TRUE   var_1_6 <= stepLocal_2
[L55]                    var_1_10 = var_1_11
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L59]        EXPR        1 << var_1_10
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L59]        COND FALSE  !((1 << var_1_10) != (-500 / -100))
[L66]                    var_1_13 = var_1_6
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L68]                    var_1_18 = var_1_3
[L69]                    signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)));
[L70]                    unsigned char stepLocal_3 = var_1_10;
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L71]        COND FALSE  !((- var_1_9) <= var_1_8)
[L84]                    var_1_16 = var_1_10
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L86]                    signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5;
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L87]        EXPR        var_1_16 >> var_1_3
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L87]                    signed long int stepLocal_0 = var_1_16 >> var_1_3;
[L88]        COND FALSE  !(stepLocal_0 == (var_1_10 / var_1_5))
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L95]        COND FALSE  !(var_1_15 || var_1_15)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L98]        COND FALSE  !(((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) == (~ 16u))
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L103]       COND TRUE   var_1_11 <= var_1_12
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L104]       COND FALSE  !(var_1_11 <= (((((var_1_11) < (var_1_6)) ? (var_1_11) : (var_1_6))) / var_1_6))
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L118]       COND FALSE  !((var_1_9 / var_1_30) > ((((var_1_8 / var_1_32) < 0 ) ? -(var_1_8 / var_1_32) : (var_1_8 / var_1_32))))
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0]
[L123]                   var_1_33 = var_1_8
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2]
[L124]       COND FALSE  !(((256 - var_1_11) <= (var_1_11 + var_1_10)) || var_1_15)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2]
[L178]       RET         step()
[L179]       CALL, EXPR  property()
[L169]       EXPR        var_1_16 >> var_1_3
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2]
[L169]       EXPR        ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2]
[L169]       EXPR        (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2]
[L169]       EXPR        1 << var_1_10
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2]
[L169]       EXPR        (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2]
[L169-L170]              return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3))
;
[L179]       RET, EXPR   property()
[L179]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2]
[L19]                    reach_error()
             VAL         [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.1s, OverallIterations: 15, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3681 SdHoareTripleChecker+Valid, 17.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3670 mSDsluCounter, 7661 SdHoareTripleChecker+Invalid, 16.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 313 IncrementalHoareTripleChecker+Unchecked, 5755 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5170 IncrementalHoareTripleChecker+Invalid, 5648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 1906 mSDtfsCounter, 5170 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1780 GetRequests, 1635 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 22.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1847occurred in iteration=13, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 3030 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 38.0s InterpolantComputationTime, 2934 NumberOfCodeBlocks, 2934 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2632 ConstructedInterpolants, 14 QuantifiedInterpolants, 14331 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1664 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 12546/12996 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:21:10,153 WARN  L435       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process
[2024-11-08 16:21:10,187 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137
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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 16:21:12,956 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-08 16:21:13,068 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 16:21:13,078 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 16:21:13,080 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 16:21:13,134 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 16:21:13,137 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 16:21:13,138 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 16:21:13,139 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 16:21:13,139 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-08 16:21:13,140 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 16:21:13,141 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 16:21:13,142 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 16:21:13,144 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-08 16:21:13,147 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-08 16:21:13,148 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 16:21:13,148 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-08 16:21:13,149 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-08 16:21:13,149 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-08 16:21:13,153 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-08 16:21:13,154 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 16:21:13,155 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 16:21:13,155 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 16:21:13,156 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-08 16:21:13,156 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-08 16:21:13,156 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-08 16:21:13,157 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 16:21:13,157 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-08 16:21:13,157 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-08 16:21:13,158 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-08 16:21:13,161 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 16:21:13,162 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-08 16:21:13,163 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 16:21:13,163 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-08 16:21:13,164 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 16:21:13,165 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 16:21:13,165 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 16:21:13,166 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 16:21:13,167 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2024-11-08 16:21:13,167 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 16:21:13,167 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 16:21:13,168 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 16:21:13,168 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 16:21:13,169 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 16:21:13,169 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_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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 -> 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba
[2024-11-08 16:21:13,758 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 16:21:13,798 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 16:21:13,803 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 16:21:13,805 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-08 16:21:13,805 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-08 16:21:13,807 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i
Unable to find full path for "g++"
[2024-11-08 16:21:16,437 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-08 16:21:16,856 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-08 16:21:16,861 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i
[2024-11-08 16:21:16,876 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/data/d9ffea8dc/88d7cc1ffe414946942809afc578ad78/FLAG0acdaa342
[2024-11-08 16:21:17,074 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/data/d9ffea8dc/88d7cc1ffe414946942809afc578ad78
[2024-11-08 16:21:17,078 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 16:21:17,080 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 16:21:17,082 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 16:21:17,082 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 16:21:17,090 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 16:21:17,091 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:21:17" (1/1) ...
[2024-11-08 16:21:17,092 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e2dd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17, skipping insertion in model container
[2024-11-08 16:21:17,093 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:21:17" (1/1) ...
[2024-11-08 16:21:17,142 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-08 16:21:17,520 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_1ce26f41-4b68-4f37-81ed-e4421ea817f8/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i[918,931]
[2024-11-08 16:21:17,664 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 16:21:17,701 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-08 16:21:17,727 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_1ce26f41-4b68-4f37-81ed-e4421ea817f8/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i[918,931]
[2024-11-08 16:21:17,775 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 16:21:17,804 INFO  L204         MainTranslator]: Completed translation
[2024-11-08 16:21:17,805 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17 WrapperNode
[2024-11-08 16:21:17,805 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 16:21:17,807 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 16:21:17,808 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 16:21:17,808 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 16:21:17,818 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:21:17" (1/1) ...
[2024-11-08 16:21:17,845 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:21:17" (1/1) ...
[2024-11-08 16:21:17,906 INFO  L138                Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159
[2024-11-08 16:21:17,910 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 16:21:17,911 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 16:21:17,911 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 16:21:17,915 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 16:21:17,931 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17" (1/1) ...
[2024-11-08 16:21:17,931 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17" (1/1) ...
[2024-11-08 16:21:17,938 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17" (1/1) ...
[2024-11-08 16:21:17,968 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:21:17,972 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17" (1/1) ...
[2024-11-08 16:21:17,973 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17" (1/1) ...
[2024-11-08 16:21:17,997 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17" (1/1) ...
[2024-11-08 16:21:18,005 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17" (1/1) ...
[2024-11-08 16:21:18,012 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17" (1/1) ...
[2024-11-08 16:21:18,015 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17" (1/1) ...
[2024-11-08 16:21:18,020 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 16:21:18,022 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 16:21:18,022 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 16:21:18,022 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-08 16:21:18,024 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17" (1/1) ...
[2024-11-08 16:21:18,032 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 16:21:18,059 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:21:18,080 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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:21:18,087 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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:21:18,130 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 16:21:18,131 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 16:21:18,131 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 16:21:18,131 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 16:21:18,132 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 16:21:18,134 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 16:21:18,297 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-08 16:21:18,300 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 16:21:28,653 INFO  L?                        ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2024-11-08 16:21:28,654 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-08 16:21:28,676 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 16:21:28,677 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 16:21:28,678 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:21:28 BoogieIcfgContainer
[2024-11-08 16:21:28,678 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 16:21:28,681 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 16:21:28,681 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 16:21:28,687 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-08 16:21:28,687 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:21:17" (1/3) ...
[2024-11-08 16:21:28,693 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b170e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:21:28, skipping insertion in model container
[2024-11-08 16:21:28,693 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:17" (2/3) ...
[2024-11-08 16:21:28,693 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b170e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:21:28, skipping insertion in model container
[2024-11-08 16:21:28,693 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:21:28" (3/3) ...
[2024-11-08 16:21:28,700 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i
[2024-11-08 16:21:28,731 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 16:21:28,731 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 16:21:28,837 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 16:21:28,847 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;@542fcff7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 16:21:28,847 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 16:21:28,855 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 74 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 53 states have internal predecessors, (79), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2024-11-08 16:21:28,878 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2024-11-08 16:21:28,879 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:21:28,881 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:28,882 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:21:28,892 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:21:28,896 INFO  L85        PathProgramCache]: Analyzing trace with hash -1092135608, now seen corresponding path program 1 times
[2024-11-08 16:21:28,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:21:28,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989738155]
[2024-11-08 16:21:28,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:21:28,925 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:21:28,926 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 16:21:28,930 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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:21:28,935 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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:21:31,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:21:31,252 INFO  L255         TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 16:21:31,263 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:21:31,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked.
[2024-11-08 16:21:31,319 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:21:31,320 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:21:31,320 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989738155]
[2024-11-08 16:21:31,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989738155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:21:31,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:21:31,322 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 16:21:31,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244176580]
[2024-11-08 16:21:31,325 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:21:31,331 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 16:21:31,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:21:31,362 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 16:21:31,363 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 16:21:31,367 INFO  L87              Difference]: Start difference. First operand  has 74 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 53 states have internal predecessors, (79), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand  has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19)
[2024-11-08 16:21:31,413 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:21:31,414 INFO  L93              Difference]: Finished difference Result 140 states and 245 transitions.
[2024-11-08 16:21:31,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-08 16:21:31,417 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 129
[2024-11-08 16:21:31,417 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:21:31,427 INFO  L225             Difference]: With dead ends: 140
[2024-11-08 16:21:31,427 INFO  L226             Difference]: Without dead ends: 69
[2024-11-08 16:21:31,432 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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:21:31,437 INFO  L432           NwaCegarLoop]: 106 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, 106 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:21:31,438 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 16:21:31,462 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2024-11-08 16:21:31,500 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2024-11-08 16:21:31,503 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 69 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2024-11-08 16:21:31,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 106 transitions.
[2024-11-08 16:21:31,512 INFO  L78                 Accepts]: Start accepts. Automaton has 69 states and 106 transitions. Word has length 129
[2024-11-08 16:21:31,512 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:21:31,512 INFO  L471      AbstractCegarLoop]: Abstraction has 69 states and 106 transitions.
[2024-11-08 16:21:31,513 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19)
[2024-11-08 16:21:31,513 INFO  L276                IsEmpty]: Start isEmpty. Operand 69 states and 106 transitions.
[2024-11-08 16:21:31,526 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2024-11-08 16:21:31,526 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:21:31,527 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:31,560 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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:21:31,728 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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:21:31,728 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:21:31,729 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:21:31,729 INFO  L85        PathProgramCache]: Analyzing trace with hash -1909639889, now seen corresponding path program 1 times
[2024-11-08 16:21:31,731 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:21:31,731 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041454575]
[2024-11-08 16:21:31,732 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:21:31,732 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 16:21:31,732 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 16:21:31,739 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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:21:31,741 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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:21:34,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:21:34,163 INFO  L255         TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 16:21:34,174 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:21:48,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked.
[2024-11-08 16:21:48,875 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 16:21:54,039 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:21:54,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041454575]
[2024-11-08 16:21:54,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041454575] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 16:21:54,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92495549]
[2024-11-08 16:21:54,041 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:21:54,042 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:21:54,043 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:21:54,046 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:21:54,055 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 16:21:55,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:21:55,698 INFO  L255         TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 16:21:55,717 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:22:07,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked.
[2024-11-08 16:22:07,811 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 16:22:10,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [92495549] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 16:22:10,925 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 16:22:10,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9
[2024-11-08 16:22:10,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822670517]
[2024-11-08 16:22:10,927 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 16:22:10,928 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-08 16:22:10,929 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:22:10,930 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 16:22:10,930 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210
[2024-11-08 16:22:10,931 INFO  L87              Difference]: Start difference. First operand 69 states and 106 transitions. Second operand  has 10 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19)
[2024-11-08 16:22:17,556 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 16:22:17,557 INFO  L93              Difference]: Finished difference Result 212 states and 321 transitions.
[2024-11-08 16:22:17,557 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-11-08 16:22:17,558 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 130
[2024-11-08 16:22:17,559 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 16:22:17,562 INFO  L225             Difference]: With dead ends: 212
[2024-11-08 16:22:17,563 INFO  L226             Difference]: Without dead ends: 146
[2024-11-08 16:22:17,564 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=210, Invalid=390, Unknown=0, NotChecked=0, Total=600
[2024-11-08 16:22:17,566 INFO  L432           NwaCegarLoop]: 67 mSDtfsCounter, 128 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time
[2024-11-08 16:22:17,567 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 415 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time]
[2024-11-08 16:22:17,569 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2024-11-08 16:22:17,604 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 113.
[2024-11-08 16:22:17,605 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 113 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38)
[2024-11-08 16:22:17,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions.
[2024-11-08 16:22:17,625 INFO  L78                 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 130
[2024-11-08 16:22:17,626 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 16:22:17,626 INFO  L471      AbstractCegarLoop]: Abstraction has 113 states and 166 transitions.
[2024-11-08 16:22:17,627 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19)
[2024-11-08 16:22:17,627 INFO  L276                IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions.
[2024-11-08 16:22:17,630 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2024-11-08 16:22:17,630 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 16:22:17,631 INFO  L215           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:17,660 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2024-11-08 16:22:17,915 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-08 16:22:18,031 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:22:18,032 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 16:22:18,033 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:22:18,033 INFO  L85        PathProgramCache]: Analyzing trace with hash -1091991439, now seen corresponding path program 1 times
[2024-11-08 16:22:18,034 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:22:18,034 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963941272]
[2024-11-08 16:22:18,034 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:22:18,034 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:22:18,035 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 16:22:18,039 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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:22:18,043 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce26f41-4b68-4f37-81ed-e4421ea817f8/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:22:20,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:22:20,352 INFO  L255         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjuncts are in the unsatisfiable core
[2024-11-08 16:22:20,360 INFO  L278         TraceCheckSpWp]: Computing forward predicates...