./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.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_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 7aa3a904bc60f2a44dbd946a0bac28cae5735c78d2e315e46c1ea5e4f1be7712
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 19:02:52,390 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 19:02:52,522 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 19:02:52,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 19:02:52,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 19:02:52,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 19:02:52,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 19:02:52,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 19:02:52,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 19:02:52,587 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 19:02:52,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 19:02:52,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 19:02:52,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 19:02:52,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 19:02:52,591 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 19:02:52,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 19:02:52,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 19:02:52,596 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 19:02:52,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 19:02:52,597 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 19:02:52,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 19:02:52,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 19:02:52,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 19:02:52,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 19:02:52,599 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 19:02:52,599 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 19:02:52,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 19:02:52,600 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 19:02:52,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 19:02:52,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 19:02:52,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 19:02:52,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 19:02:52,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 19:02:52,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 19:02:52,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 19:02:52,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 19:02:52,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 19:02:52,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 19:02:52,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 19:02:52,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 19:02:52,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 19:02:52,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 19:02:52,614 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_c09a9d61-4614-4a78-8a98-f0c72151ece2/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_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 -> 7aa3a904bc60f2a44dbd946a0bac28cae5735c78d2e315e46c1ea5e4f1be7712
[2024-11-08 19:02:52,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 19:02:53,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 19:02:53,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 19:02:53,012 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 19:02:53,013 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 19:02:53,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i
Unable to find full path for "g++"
[2024-11-08 19:02:55,490 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 19:02:55,769 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 19:02:55,769 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i
[2024-11-08 19:02:55,782 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/data/872ec4319/75e7d14bfb9d4811b3b98177c49a6d5f/FLAG77369eb5a
[2024-11-08 19:02:56,096 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/data/872ec4319/75e7d14bfb9d4811b3b98177c49a6d5f
[2024-11-08 19:02:56,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 19:02:56,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 19:02:56,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 19:02:56,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 19:02:56,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 19:02:56,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:56,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b04c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56, skipping insertion in model container
[2024-11-08 19:02:56,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:56,177 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 19:02:56,439 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_c09a9d61-4614-4a78-8a98-f0c72151ece2/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i[915,928]
[2024-11-08 19:02:56,594 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 19:02:56,621 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 19:02:56,642 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_c09a9d61-4614-4a78-8a98-f0c72151ece2/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i[915,928]
[2024-11-08 19:02:56,719 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 19:02:56,758 INFO L204 MainTranslator]: Completed translation
[2024-11-08 19:02:56,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56 WrapperNode
[2024-11-08 19:02:56,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 19:02:56,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 19:02:56,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 19:02:56,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 19:02:56,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:56,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:56,931 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187
[2024-11-08 19:02:56,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 19:02:56,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 19:02:56,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 19:02:56,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 19:02:56,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:56,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:56,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:57,058 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 19:02:57,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:57,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:57,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:57,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:57,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:57,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:57,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 19:02:57,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 19:02:57,105 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 19:02:57,106 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 19:02:57,107 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (1/1) ...
[2024-11-08 19:02:57,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 19:02:57,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 19:02:57,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 19:02:57,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 19:02:57,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 19:02:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 19:02:57,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 19:02:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 19:02:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 19:02:57,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 19:02:57,348 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 19:02:57,351 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 19:02:58,032 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live.
[2024-11-08 19:02:58,033 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 19:02:58,062 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 19:02:58,066 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 19:02:58,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:02:58 BoogieIcfgContainer
[2024-11-08 19:02:58,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 19:02:58,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 19:02:58,072 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 19:02:58,077 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 19:02:58,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:02:56" (1/3) ...
[2024-11-08 19:02:58,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f89e729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:02:58, skipping insertion in model container
[2024-11-08 19:02:58,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:56" (2/3) ...
[2024-11-08 19:02:58,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f89e729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:02:58, skipping insertion in model container
[2024-11-08 19:02:58,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:02:58" (3/3) ...
[2024-11-08 19:02:58,083 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-78.i
[2024-11-08 19:02:58,108 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 19:02:58,109 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 19:02:58,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 19:02:58,194 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;@5324969f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 19:02:58,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 19:02:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-08 19:02:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2024-11-08 19:02:58,215 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:02:58,216 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:02:58,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:02:58,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:02:58,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1626753809, now seen corresponding path program 1 times
[2024-11-08 19:02:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:02:58,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911255410]
[2024-11-08 19:02:58,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:02:58,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:02:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 19:02:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 19:02:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 19:02:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 19:02:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 19:02:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 19:02:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 19:02:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 19:02:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 19:02:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 19:02:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 19:02:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 19:02:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 19:02:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 19:02:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-08 19:02:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 19:02:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-08 19:02:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 19:02:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-08 19:02:58,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:02:58,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911255410]
[2024-11-08 19:02:58,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911255410] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:02:58,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:02:58,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 19:02:58,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267486288]
[2024-11-08 19:02:58,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:02:58,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 19:02:58,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:02:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 19:02:58,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 19:02:58,982 INFO L87 Difference]: Start difference. First operand has 78 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18)
[2024-11-08 19:02:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:02:59,035 INFO L93 Difference]: Finished difference Result 149 states and 246 transitions.
[2024-11-08 19:02:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 19:02:59,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124
[2024-11-08 19:02:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:02:59,054 INFO L225 Difference]: With dead ends: 149
[2024-11-08 19:02:59,054 INFO L226 Difference]: Without dead ends: 74
[2024-11-08 19:02:59,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 19:02:59,064 INFO L432 NwaCegarLoop]: 110 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, 110 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 19:02:59,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 19:02:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2024-11-08 19:02:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74.
[2024-11-08 19:02:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-08 19:02:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions.
[2024-11-08 19:02:59,157 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 124
[2024-11-08 19:02:59,158 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:02:59,158 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 110 transitions.
[2024-11-08 19:02:59,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18)
[2024-11-08 19:02:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions.
[2024-11-08 19:02:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2024-11-08 19:02:59,165 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:02:59,165 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:02:59,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 19:02:59,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:02:59,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:02:59,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1307518691, now seen corresponding path program 1 times
[2024-11-08 19:02:59,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:02:59,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398937381]
[2024-11-08 19:02:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:02:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:02:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 19:03:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 19:03:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 19:03:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 19:03:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 19:03:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 19:03:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 19:03:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 19:03:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 19:03:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 19:03:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 19:03:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 19:03:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 19:03:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 19:03:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-08 19:03:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 19:03:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-08 19:03:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 19:03:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-08 19:03:00,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:03:00,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398937381]
[2024-11-08 19:03:00,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398937381] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:03:00,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:03:00,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 19:03:00,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237218535]
[2024-11-08 19:03:00,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:03:00,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 19:03:00,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:03:00,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 19:03:00,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 19:03:00,203 INFO L87 Difference]: Start difference. First operand 74 states and 110 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:00,491 INFO L93 Difference]: Finished difference Result 182 states and 272 transitions.
[2024-11-08 19:03:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 19:03:00,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124
[2024-11-08 19:03:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:00,495 INFO L225 Difference]: With dead ends: 182
[2024-11-08 19:03:00,496 INFO L226 Difference]: Without dead ends: 111
[2024-11-08 19:03:00,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-08 19:03:00,498 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 45 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 19:03:00,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 516 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 19:03:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states.
[2024-11-08 19:03:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92.
[2024-11-08 19:03:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-08 19:03:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 139 transitions.
[2024-11-08 19:03:00,521 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 139 transitions. Word has length 124
[2024-11-08 19:03:00,523 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:00,525 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 139 transitions.
[2024-11-08 19:03:00,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 139 transitions.
[2024-11-08 19:03:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2024-11-08 19:03:00,529 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:00,530 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:00,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 19:03:00,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:00,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:00,532 INFO L85 PathProgramCache]: Analyzing trace with hash 686626015, now seen corresponding path program 1 times
[2024-11-08 19:03:00,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:03:00,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783866211]
[2024-11-08 19:03:00,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:00,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:03:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 19:03:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 19:03:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 19:03:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 19:03:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 19:03:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 19:03:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 19:03:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 19:03:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 19:03:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 19:03:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 19:03:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 19:03:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 19:03:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 19:03:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-08 19:03:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 19:03:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-08 19:03:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 19:03:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-08 19:03:00,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:03:00,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783866211]
[2024-11-08 19:03:00,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783866211] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:03:00,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:03:00,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 19:03:00,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261596700]
[2024-11-08 19:03:00,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:03:00,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 19:03:00,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:03:00,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 19:03:00,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 19:03:00,909 INFO L87 Difference]: Start difference. First operand 92 states and 139 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:00,963 INFO L93 Difference]: Finished difference Result 181 states and 275 transitions.
[2024-11-08 19:03:00,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 19:03:00,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124
[2024-11-08 19:03:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:00,967 INFO L225 Difference]: With dead ends: 181
[2024-11-08 19:03:00,967 INFO L226 Difference]: Without dead ends: 92
[2024-11-08 19:03:00,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 19:03:00,970 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 19:03:00,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 19:03:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2024-11-08 19:03:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2024-11-08 19:03:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 72 states have internal predecessors, (101), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-08 19:03:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions.
[2024-11-08 19:03:00,986 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 124
[2024-11-08 19:03:00,987 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:00,987 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions.
[2024-11-08 19:03:00,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions.
[2024-11-08 19:03:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-08 19:03:00,991 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:00,991 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:00,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 19:03:00,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:00,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:00,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1304654365, now seen corresponding path program 1 times
[2024-11-08 19:03:00,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:03:00,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71196729]
[2024-11-08 19:03:00,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:03:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 19:03:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 19:03:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 19:03:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 19:03:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 19:03:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 19:03:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 19:03:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 19:03:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 19:03:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 19:03:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 19:03:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 19:03:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 19:03:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 19:03:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-08 19:03:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 19:03:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-08 19:03:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 19:03:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-08 19:03:01,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:03:01,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71196729]
[2024-11-08 19:03:01,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71196729] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:03:01,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:03:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 19:03:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771078042]
[2024-11-08 19:03:01,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:03:01,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 19:03:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:03:01,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 19:03:01,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 19:03:01,422 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:01,702 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions.
[2024-11-08 19:03:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 19:03:01,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125
[2024-11-08 19:03:01,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:01,706 INFO L225 Difference]: With dead ends: 271
[2024-11-08 19:03:01,709 INFO L226 Difference]: Without dead ends: 182
[2024-11-08 19:03:01,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 19:03:01,712 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 84 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 19:03:01,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 284 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 19:03:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states.
[2024-11-08 19:03:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165.
[2024-11-08 19:03:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 126 states have internal predecessors, (175), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2024-11-08 19:03:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions.
[2024-11-08 19:03:01,768 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 125
[2024-11-08 19:03:01,769 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:01,769 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions.
[2024-11-08 19:03:01,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions.
[2024-11-08 19:03:01,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2024-11-08 19:03:01,777 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:01,778 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:01,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 19:03:01,778 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:01,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:01,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1238368373, now seen corresponding path program 1 times
[2024-11-08 19:03:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:03:01,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788738528]
[2024-11-08 19:03:01,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:01,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:03:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 19:03:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 19:03:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 19:03:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 19:03:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 19:03:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 19:03:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 19:03:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 19:03:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 19:03:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 19:03:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 19:03:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 19:03:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 19:03:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 19:03:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-08 19:03:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 19:03:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-08 19:03:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 19:03:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-08 19:03:02,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:03:02,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788738528]
[2024-11-08 19:03:02,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788738528] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:03:02,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:03:02,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 19:03:02,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686814490]
[2024-11-08 19:03:02,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:03:02,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 19:03:02,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:03:02,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 19:03:02,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 19:03:02,195 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:02,458 INFO L93 Difference]: Finished difference Result 399 states and 594 transitions.
[2024-11-08 19:03:02,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 19:03:02,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126
[2024-11-08 19:03:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:02,462 INFO L225 Difference]: With dead ends: 399
[2024-11-08 19:03:02,462 INFO L226 Difference]: Without dead ends: 281
[2024-11-08 19:03:02,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 19:03:02,464 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 122 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 19:03:02,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 311 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 19:03:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states.
[2024-11-08 19:03:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 263.
[2024-11-08 19:03:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 205 states have (on average 1.3707317073170733) internal successors, (281), 205 states have internal predecessors, (281), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54)
[2024-11-08 19:03:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 389 transitions.
[2024-11-08 19:03:02,514 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 389 transitions. Word has length 126
[2024-11-08 19:03:02,515 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:02,518 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 389 transitions.
[2024-11-08 19:03:02,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 389 transitions.
[2024-11-08 19:03:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2024-11-08 19:03:02,521 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:02,521 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:02,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 19:03:02,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:02,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash 841910904, now seen corresponding path program 1 times
[2024-11-08 19:03:02,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:03:02,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783621315]
[2024-11-08 19:03:02,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:02,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:03:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 19:03:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 19:03:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 19:03:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 19:03:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 19:03:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 19:03:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 19:03:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 19:03:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 19:03:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 19:03:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 19:03:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 19:03:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 19:03:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 19:03:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-08 19:03:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 19:03:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:02,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-08 19:03:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:03,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 19:03:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-08 19:03:03,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:03:03,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783621315]
[2024-11-08 19:03:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783621315] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:03:03,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:03:03,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 19:03:03,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236638679]
[2024-11-08 19:03:03,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:03:03,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 19:03:03,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:03:03,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 19:03:03,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-08 19:03:03,014 INFO L87 Difference]: Start difference. First operand 263 states and 389 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:03,450 INFO L93 Difference]: Finished difference Result 737 states and 1085 transitions.
[2024-11-08 19:03:03,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-08 19:03:03,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127
[2024-11-08 19:03:03,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:03,455 INFO L225 Difference]: With dead ends: 737
[2024-11-08 19:03:03,456 INFO L226 Difference]: Without dead ends: 543
[2024-11-08 19:03:03,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182
[2024-11-08 19:03:03,458 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 265 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 19:03:03,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 621 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 19:03:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states.
[2024-11-08 19:03:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 477.
[2024-11-08 19:03:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 381 states have (on average 1.3858267716535433) internal successors, (528), 381 states have internal predecessors, (528), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90)
[2024-11-08 19:03:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 708 transitions.
[2024-11-08 19:03:03,513 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 708 transitions. Word has length 127
[2024-11-08 19:03:03,514 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:03,514 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 708 transitions.
[2024-11-08 19:03:03,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 708 transitions.
[2024-11-08 19:03:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2024-11-08 19:03:03,517 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:03,517 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:03,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 19:03:03,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:03,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:03,518 INFO L85 PathProgramCache]: Analyzing trace with hash 448883894, now seen corresponding path program 1 times
[2024-11-08 19:03:03,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:03:03,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563194841]
[2024-11-08 19:03:03,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:03,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:03:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:03,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 19:03:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 19:03:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:03,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 19:03:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:03,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 19:03:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 19:03:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 19:03:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 19:03:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 19:03:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 19:03:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 19:03:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 19:03:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 19:03:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 19:03:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 19:03:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-08 19:03:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 19:03:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-08 19:03:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 19:03:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-08 19:03:04,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:03:04,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563194841]
[2024-11-08 19:03:04,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563194841] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:03:04,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:03:04,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 19:03:04,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540029823]
[2024-11-08 19:03:04,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:03:04,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 19:03:04,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:03:04,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 19:03:04,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 19:03:04,134 INFO L87 Difference]: Start difference. First operand 477 states and 708 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:04,437 INFO L93 Difference]: Finished difference Result 969 states and 1430 transitions.
[2024-11-08 19:03:04,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 19:03:04,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127
[2024-11-08 19:03:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:04,446 INFO L225 Difference]: With dead ends: 969
[2024-11-08 19:03:04,446 INFO L226 Difference]: Without dead ends: 539
[2024-11-08 19:03:04,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 19:03:04,449 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 76 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 19:03:04,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 284 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 19:03:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states.
[2024-11-08 19:03:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 485.
[2024-11-08 19:03:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 389 states have (on average 1.3727506426735219) internal successors, (534), 389 states have internal predecessors, (534), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90)
[2024-11-08 19:03:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 714 transitions.
[2024-11-08 19:03:04,557 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 714 transitions. Word has length 127
[2024-11-08 19:03:04,558 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:04,558 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 714 transitions.
[2024-11-08 19:03:04,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 714 transitions.
[2024-11-08 19:03:04,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2024-11-08 19:03:04,561 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:04,561 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:04,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 19:03:04,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:04,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:04,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1816782278, now seen corresponding path program 1 times
[2024-11-08 19:03:04,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:03:04,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657812912]
[2024-11-08 19:03:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:04,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:03:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 19:03:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 19:03:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 19:03:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 19:03:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 19:03:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 19:03:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 19:03:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 19:03:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 19:03:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 19:03:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 19:03:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 19:03:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 19:03:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 19:03:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-08 19:03:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 19:03:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-08 19:03:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 19:03:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-08 19:03:05,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:03:05,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657812912]
[2024-11-08 19:03:05,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657812912] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:03:05,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:03:05,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 19:03:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932427858]
[2024-11-08 19:03:05,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:03:05,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 19:03:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:03:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 19:03:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 19:03:05,205 INFO L87 Difference]: Start difference. First operand 485 states and 714 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:05,603 INFO L93 Difference]: Finished difference Result 1104 states and 1616 transitions.
[2024-11-08 19:03:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 19:03:05,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128
[2024-11-08 19:03:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:05,608 INFO L225 Difference]: With dead ends: 1104
[2024-11-08 19:03:05,608 INFO L226 Difference]: Without dead ends: 692
[2024-11-08 19:03:05,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-08 19:03:05,611 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 125 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 19:03:05,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 445 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 19:03:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states.
[2024-11-08 19:03:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 604.
[2024-11-08 19:03:05,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 470 states have (on average 1.3425531914893618) internal successors, (631), 470 states have internal predecessors, (631), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126)
[2024-11-08 19:03:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 883 transitions.
[2024-11-08 19:03:05,689 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 883 transitions. Word has length 128
[2024-11-08 19:03:05,690 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:05,690 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 883 transitions.
[2024-11-08 19:03:05,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 883 transitions.
[2024-11-08 19:03:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-11-08 19:03:05,692 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:05,692 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:05,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 19:03:05,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:05,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:05,693 INFO L85 PathProgramCache]: Analyzing trace with hash 588087360, now seen corresponding path program 1 times
[2024-11-08 19:03:05,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:03:05,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560672662]
[2024-11-08 19:03:05,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:05,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:03:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-08 19:03:05,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [102693141]
[2024-11-08 19:03:05,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:05,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 19:03:05,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 19:03:05,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 19:03:05,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 19:03:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:06,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 19:03:06,501 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 19:03:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked.
[2024-11-08 19:03:07,400 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 19:03:08,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:03:08,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560672662]
[2024-11-08 19:03:08,288 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-08 19:03:08,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102693141]
[2024-11-08 19:03:08,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102693141] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 19:03:08,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2024-11-08 19:03:08,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2024-11-08 19:03:08,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549914186]
[2024-11-08 19:03:08,289 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2024-11-08 19:03:08,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 19:03:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:03:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 19:03:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2024-11-08 19:03:08,292 INFO L87 Difference]: Start difference. First operand 604 states and 883 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)
[2024-11-08 19:03:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:09,099 INFO L93 Difference]: Finished difference Result 1461 states and 2091 transitions.
[2024-11-08 19:03:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-11-08 19:03:09,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133
[2024-11-08 19:03:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:09,105 INFO L225 Difference]: With dead ends: 1461
[2024-11-08 19:03:09,106 INFO L226 Difference]: Without dead ends: 1078
[2024-11-08 19:03:09,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306
[2024-11-08 19:03:09,108 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 106 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 19:03:09,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 505 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 19:03:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states.
[2024-11-08 19:03:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1034.
[2024-11-08 19:03:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 804 states have (on average 1.3258706467661692) internal successors, (1066), 808 states have internal predecessors, (1066), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206)
[2024-11-08 19:03:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1478 transitions.
[2024-11-08 19:03:09,221 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1478 transitions. Word has length 133
[2024-11-08 19:03:09,221 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:09,221 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1478 transitions.
[2024-11-08 19:03:09,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)
[2024-11-08 19:03:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1478 transitions.
[2024-11-08 19:03:09,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-11-08 19:03:09,223 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:09,224 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:09,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 19:03:09,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 19:03:09,425 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:09,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:09,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1050302588, now seen corresponding path program 1 times
[2024-11-08 19:03:09,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:03:09,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159567268]
[2024-11-08 19:03:09,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:09,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:03:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 19:03:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 19:03:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 19:03:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 19:03:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 19:03:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 19:03:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 19:03:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 19:03:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 19:03:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 19:03:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 19:03:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 19:03:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 19:03:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 19:03:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-08 19:03:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 19:03:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2024-11-08 19:03:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 19:03:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-08 19:03:09,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:03:09,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159567268]
[2024-11-08 19:03:09,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159567268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:03:09,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:03:09,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 19:03:09,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237837678]
[2024-11-08 19:03:09,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:03:09,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 19:03:09,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:03:09,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 19:03:09,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 19:03:09,784 INFO L87 Difference]: Start difference. First operand 1034 states and 1478 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:09,959 INFO L93 Difference]: Finished difference Result 1790 states and 2584 transitions.
[2024-11-08 19:03:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 19:03:09,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133
[2024-11-08 19:03:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:09,973 INFO L225 Difference]: With dead ends: 1790
[2024-11-08 19:03:09,974 INFO L226 Difference]: Without dead ends: 1375
[2024-11-08 19:03:09,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-08 19:03:09,977 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 19:03:09,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 325 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 19:03:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states.
[2024-11-08 19:03:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1037.
[2024-11-08 19:03:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 807 states have (on average 1.3246592317224288) internal successors, (1069), 811 states have internal predecessors, (1069), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206)
[2024-11-08 19:03:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1481 transitions.
[2024-11-08 19:03:10,152 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1481 transitions. Word has length 133
[2024-11-08 19:03:10,153 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:10,153 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1481 transitions.
[2024-11-08 19:03:10,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1481 transitions.
[2024-11-08 19:03:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-11-08 19:03:10,155 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:10,156 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:10,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-08 19:03:10,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:10,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash -229561090, now seen corresponding path program 1 times
[2024-11-08 19:03:10,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:03:10,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359427649]
[2024-11-08 19:03:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:10,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:03:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-08 19:03:10,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545012227]
[2024-11-08 19:03:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:10,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 19:03:10,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 19:03:10,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 19:03:10,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 19:03:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:03:10,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:03:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:03:10,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:03:10,856 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 19:03:10,857 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 19:03:10,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 19:03:11,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2024-11-08 19:03:11,063 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 19:03:11,194 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 19:03:11,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:03:11 BoogieIcfgContainer
[2024-11-08 19:03:11,198 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 19:03:11,199 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 19:03:11,199 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 19:03:11,199 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 19:03:11,200 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:02:58" (3/4) ...
[2024-11-08 19:03:11,203 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 19:03:11,204 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 19:03:11,205 INFO L158 Benchmark]: Toolchain (without parser) took 15104.21ms. Allocated memory was 125.8MB in the beginning and 249.6MB in the end (delta: 123.7MB). Free memory was 84.0MB in the beginning and 132.2MB in the end (delta: -48.2MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB.
[2024-11-08 19:03:11,205 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 125.8MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 19:03:11,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.93ms. Allocated memory is still 125.8MB. Free memory was 83.6MB in the beginning and 66.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-08 19:03:11,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 171.61ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 66.0MB in the beginning and 128.5MB in the end (delta: -62.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB.
[2024-11-08 19:03:11,206 INFO L158 Benchmark]: Boogie Preprocessor took 170.92ms. Allocated memory is still 161.5MB. Free memory was 128.5MB in the beginning and 119.8MB in the end (delta: 8.7MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB.
[2024-11-08 19:03:11,207 INFO L158 Benchmark]: RCFGBuilder took 962.08ms. Allocated memory is still 161.5MB. Free memory was 119.8MB in the beginning and 88.5MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB.
[2024-11-08 19:03:11,207 INFO L158 Benchmark]: TraceAbstraction took 13126.15ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 87.4MB in the beginning and 132.2MB in the end (delta: -44.7MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB.
[2024-11-08 19:03:11,207 INFO L158 Benchmark]: Witness Printer took 5.58ms. Allocated memory is still 249.6MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 19:03:11,210 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.38ms. Allocated memory is still 125.8MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 656.93ms. Allocated memory is still 125.8MB. Free memory was 83.6MB in the beginning and 66.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 171.61ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 66.0MB in the beginning and 128.5MB in the end (delta: -62.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 170.92ms. Allocated memory is still 161.5MB. Free memory was 128.5MB in the beginning and 119.8MB in the end (delta: 8.7MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB.
* RCFGBuilder took 962.08ms. Allocated memory is still 161.5MB. Free memory was 119.8MB in the beginning and 88.5MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 13126.15ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 87.4MB in the beginning and 132.2MB in the end (delta: -44.7MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB.
* Witness Printer took 5.58ms. Allocated memory is still 249.6MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of bitwiseOr at line 119, overapproximation of someBinaryArithmeticDOUBLEoperation at line 64.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] signed long int var_1_1 = -4;
[L23] unsigned char var_1_3 = 64;
[L24] unsigned char var_1_4 = 0;
[L25] unsigned char var_1_5 = 2;
[L26] unsigned short int var_1_6 = 10;
[L27] double var_1_8 = 1.875;
[L28] signed long int var_1_9 = -4;
[L29] double var_1_10 = 63.5;
[L30] double var_1_11 = 255.375;
[L31] double var_1_12 = 999999999.525;
[L32] double var_1_13 = 63.75;
[L33] double var_1_14 = 0.625;
[L34] unsigned short int var_1_15 = 5;
[L35] signed char var_1_16 = 4;
[L36] signed char var_1_17 = 0;
[L37] signed char var_1_18 = -2;
[L38] signed char var_1_19 = 1;
[L39] unsigned short int var_1_20 = 50;
[L40] unsigned short int var_1_21 = 0;
[L41] unsigned char last_1_var_1_3 = 64;
[L42] unsigned short int last_1_var_1_6 = 10;
[L43] unsigned short int last_1_var_1_15 = 5;
[L44] unsigned short int last_1_var_1_20 = 50;
[L45] unsigned short int last_1_var_1_21 = 0;
VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L123] isInitial = 1
[L124] FCALL initially()
[L125] COND TRUE 1
[L126] CALL updateLastVariables()
[L112] last_1_var_1_3 = var_1_3
[L113] last_1_var_1_6 = var_1_6
[L114] last_1_var_1_15 = var_1_15
[L115] last_1_var_1_20 = var_1_20
[L116] last_1_var_1_21 = var_1_21
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L126] RET updateLastVariables()
[L127] CALL updateVariables()
[L81] var_1_4 = __VERIFIER_nondet_uchar()
[L82] CALL assume_abort_if_not(var_1_4 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L82] RET assume_abort_if_not(var_1_4 >= 0)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L83] CALL assume_abort_if_not(var_1_4 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L83] RET assume_abort_if_not(var_1_4 <= 254)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L84] var_1_5 = __VERIFIER_nondet_uchar()
[L85] CALL assume_abort_if_not(var_1_5 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L85] RET assume_abort_if_not(var_1_5 >= 0)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L86] CALL assume_abort_if_not(var_1_5 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L86] RET assume_abort_if_not(var_1_5 <= 254)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L87] var_1_9 = __VERIFIER_nondet_long()
[L88] CALL assume_abort_if_not(var_1_9 >= -2147483648)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L88] RET assume_abort_if_not(var_1_9 >= -2147483648)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L89] CALL assume_abort_if_not(var_1_9 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L89] RET assume_abort_if_not(var_1_9 <= 2147483647)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L90] CALL assume_abort_if_not(var_1_9 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L90] RET assume_abort_if_not(var_1_9 != 0)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L91] var_1_10 = __VERIFIER_nondet_double()
[L92] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L92] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L93] var_1_11 = __VERIFIER_nondet_double()
[L94] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L94] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L95] var_1_12 = __VERIFIER_nondet_double()
[L96] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L96] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L97] var_1_13 = __VERIFIER_nondet_double()
[L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L99] var_1_14 = __VERIFIER_nondet_double()
[L100] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L100] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L101] var_1_17 = __VERIFIER_nondet_char()
[L102] CALL assume_abort_if_not(var_1_17 >= -63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L102] RET assume_abort_if_not(var_1_17 >= -63)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L103] CALL assume_abort_if_not(var_1_17 <= 63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L103] RET assume_abort_if_not(var_1_17 <= 63)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L104] var_1_18 = __VERIFIER_nondet_char()
[L105] CALL assume_abort_if_not(var_1_18 >= -31)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L105] RET assume_abort_if_not(var_1_18 >= -31)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L106] CALL assume_abort_if_not(var_1_18 <= 32)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L106] RET assume_abort_if_not(var_1_18 <= 32)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L107] var_1_19 = __VERIFIER_nondet_char()
[L108] CALL assume_abort_if_not(var_1_19 >= -31)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L108] RET assume_abort_if_not(var_1_19 >= -31)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L109] CALL assume_abort_if_not(var_1_19 <= 31)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L109] RET assume_abort_if_not(var_1_19 <= 31)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L127] RET updateVariables()
[L128] CALL step()
[L49] signed long int stepLocal_0 = last_1_var_1_21;
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L50] COND FALSE !(last_1_var_1_6 < stepLocal_0)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L53] EXPR last_1_var_1_20 ^ last_1_var_1_15
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L53] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15;
[L54] unsigned char stepLocal_1 = var_1_5;
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=197, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L55] COND FALSE !(stepLocal_2 < -256)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=197, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L58] COND FALSE !(stepLocal_1 <= 50)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L62] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66]
[L63] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))
[L64] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14))
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66]
[L70] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))
[L71] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))
[L72] unsigned short int stepLocal_3 = var_1_6;
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66]
[L73] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66]
[L73] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18)))
[L76] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21
[L77] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4))))
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66]
[L128] RET step()
[L129] CALL, EXPR property()
[L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66]
[L119] EXPR last_1_var_1_20 ^ last_1_var_1_15
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66]
[L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66]
[L119] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66]
[L119-L120] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1)
;
[L129] RET, EXPR property()
[L129] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 896 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 892 mSDsluCounter, 3714 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2573 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 783 IncrementalHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 1141 mSDtfsCounter, 783 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 570 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1037occurred in iteration=10, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 644 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1670 NumberOfCodeBlocks, 1670 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1261 ConstructedInterpolants, 0 QuantifiedInterpolants, 3941 SizeOfPredicates, 4 NumberOfNonLiveVariables, 322 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6078/6120 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 19:03:11,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 7aa3a904bc60f2a44dbd946a0bac28cae5735c78d2e315e46c1ea5e4f1be7712
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 19:03:14,066 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 19:03:14,177 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 19:03:14,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 19:03:14,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 19:03:14,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 19:03:14,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 19:03:14,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 19:03:14,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 19:03:14,223 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 19:03:14,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 19:03:14,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 19:03:14,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 19:03:14,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 19:03:14,226 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 19:03:14,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 19:03:14,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 19:03:14,227 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 19:03:14,228 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 19:03:14,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 19:03:14,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 19:03:14,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 19:03:14,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 19:03:14,230 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 19:03:14,231 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 19:03:14,231 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 19:03:14,231 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 19:03:14,235 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 19:03:14,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 19:03:14,236 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 19:03:14,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 19:03:14,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 19:03:14,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 19:03:14,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 19:03:14,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 19:03:14,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 19:03:14,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 19:03:14,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 19:03:14,239 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 19:03:14,239 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 19:03:14,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 19:03:14,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 19:03:14,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 19:03:14,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 19:03:14,242 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_c09a9d61-4614-4a78-8a98-f0c72151ece2/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_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 -> 7aa3a904bc60f2a44dbd946a0bac28cae5735c78d2e315e46c1ea5e4f1be7712
[2024-11-08 19:03:14,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 19:03:14,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 19:03:14,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 19:03:14,757 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 19:03:14,758 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 19:03:14,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i
Unable to find full path for "g++"
[2024-11-08 19:03:17,122 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 19:03:17,473 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 19:03:17,474 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i
[2024-11-08 19:03:17,487 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/data/f7bb4ad8c/7e127a7a118f48dcafca746bf7d82c4a/FLAG6fb246bfe
[2024-11-08 19:03:17,737 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/data/f7bb4ad8c/7e127a7a118f48dcafca746bf7d82c4a
[2024-11-08 19:03:17,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 19:03:17,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 19:03:17,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 19:03:17,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 19:03:17,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 19:03:17,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:03:17" (1/1) ...
[2024-11-08 19:03:17,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d07770c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:17, skipping insertion in model container
[2024-11-08 19:03:17,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:03:17" (1/1) ...
[2024-11-08 19:03:17,807 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 19:03:18,110 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_c09a9d61-4614-4a78-8a98-f0c72151ece2/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i[915,928]
[2024-11-08 19:03:18,251 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 19:03:18,278 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 19:03:18,298 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_c09a9d61-4614-4a78-8a98-f0c72151ece2/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i[915,928]
[2024-11-08 19:03:18,349 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 19:03:18,374 INFO L204 MainTranslator]: Completed translation
[2024-11-08 19:03:18,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18 WrapperNode
[2024-11-08 19:03:18,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 19:03:18,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 19:03:18,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 19:03:18,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 19:03:18,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (1/1) ...
[2024-11-08 19:03:18,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (1/1) ...
[2024-11-08 19:03:18,435 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134
[2024-11-08 19:03:18,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 19:03:18,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 19:03:18,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 19:03:18,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 19:03:18,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (1/1) ...
[2024-11-08 19:03:18,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (1/1) ...
[2024-11-08 19:03:18,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (1/1) ...
[2024-11-08 19:03:18,473 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 19:03:18,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (1/1) ...
[2024-11-08 19:03:18,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (1/1) ...
[2024-11-08 19:03:18,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (1/1) ...
[2024-11-08 19:03:18,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (1/1) ...
[2024-11-08 19:03:18,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (1/1) ...
[2024-11-08 19:03:18,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (1/1) ...
[2024-11-08 19:03:18,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 19:03:18,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 19:03:18,507 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 19:03:18,507 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 19:03:18,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (1/1) ...
[2024-11-08 19:03:18,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 19:03:18,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 19:03:18,555 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 19:03:18,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 19:03:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 19:03:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 19:03:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 19:03:18,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 19:03:18,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 19:03:18,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 19:03:18,718 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 19:03:18,721 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 19:03:26,541 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2024-11-08 19:03:26,541 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 19:03:26,557 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 19:03:26,557 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 19:03:26,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:03:26 BoogieIcfgContainer
[2024-11-08 19:03:26,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 19:03:26,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 19:03:26,561 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 19:03:26,569 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 19:03:26,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:03:17" (1/3) ...
[2024-11-08 19:03:26,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56267117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:03:26, skipping insertion in model container
[2024-11-08 19:03:26,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:03:18" (2/3) ...
[2024-11-08 19:03:26,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56267117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:03:26, skipping insertion in model container
[2024-11-08 19:03:26,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:03:26" (3/3) ...
[2024-11-08 19:03:26,576 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-78.i
[2024-11-08 19:03:26,598 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 19:03:26,598 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 19:03:26,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 19:03:26,688 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;@5d5a2cb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 19:03:26,688 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 19:03:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-08 19:03:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2024-11-08 19:03:26,708 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:26,709 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:26,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:26,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1238824143, now seen corresponding path program 1 times
[2024-11-08 19:03:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 19:03:26,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605032475]
[2024-11-08 19:03:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:26,734 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 19:03:26,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 19:03:26,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 19:03:26,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 19:03:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:27,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 19:03:27,427 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 19:03:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked.
[2024-11-08 19:03:27,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 19:03:27,480 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 19:03:27,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605032475]
[2024-11-08 19:03:27,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605032475] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:03:27,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:03:27,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 19:03:27,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294067034]
[2024-11-08 19:03:27,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:03:27,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 19:03:27,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 19:03:27,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 19:03:27,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 19:03:27,528 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)
[2024-11-08 19:03:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:27,562 INFO L93 Difference]: Finished difference Result 109 states and 182 transitions.
[2024-11-08 19:03:27,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 19:03:27,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118
[2024-11-08 19:03:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:27,578 INFO L225 Difference]: With dead ends: 109
[2024-11-08 19:03:27,579 INFO L226 Difference]: Without dead ends: 54
[2024-11-08 19:03:27,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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 19:03:27,587 INFO L432 NwaCegarLoop]: 78 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, 78 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 19:03:27,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 19:03:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2024-11-08 19:03:27,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2024-11-08 19:03:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-08 19:03:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions.
[2024-11-08 19:03:27,645 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 118
[2024-11-08 19:03:27,645 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:27,646 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions.
[2024-11-08 19:03:27,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)
[2024-11-08 19:03:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions.
[2024-11-08 19:03:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2024-11-08 19:03:27,652 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:27,652 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:27,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 19:03:27,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 19:03:27,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:27,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:27,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1503269437, now seen corresponding path program 1 times
[2024-11-08 19:03:27,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 19:03:27,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236358522]
[2024-11-08 19:03:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:27,861 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 19:03:27,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 19:03:27,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 19:03:27,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 19:03:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:28,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 19:03:28,536 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 19:03:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-08 19:03:28,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 19:03:28,667 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 19:03:28,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236358522]
[2024-11-08 19:03:28,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236358522] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:03:28,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:03:28,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 19:03:28,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11450079]
[2024-11-08 19:03:28,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:03:28,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 19:03:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 19:03:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 19:03:28,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 19:03:28,676 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:32,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-08 19:03:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:32,576 INFO L93 Difference]: Finished difference Result 105 states and 153 transitions.
[2024-11-08 19:03:32,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 19:03:32,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118
[2024-11-08 19:03:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:32,620 INFO L225 Difference]: With dead ends: 105
[2024-11-08 19:03:32,621 INFO L226 Difference]: Without dead ends: 54
[2024-11-08 19:03:32,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 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 19:03:32,625 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time
[2024-11-08 19:03:32,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time]
[2024-11-08 19:03:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2024-11-08 19:03:32,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2024-11-08 19:03:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2024-11-08 19:03:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions.
[2024-11-08 19:03:32,647 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 118
[2024-11-08 19:03:32,651 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:32,651 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions.
[2024-11-08 19:03:32,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:32,652 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions.
[2024-11-08 19:03:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-08 19:03:32,654 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:32,655 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:32,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-08 19:03:32,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 19:03:32,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:32,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:32,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1089988374, now seen corresponding path program 1 times
[2024-11-08 19:03:32,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 19:03:32,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005790158]
[2024-11-08 19:03:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:32,860 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 19:03:32,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 19:03:32,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 19:03:32,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-08 19:03:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:33,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-08 19:03:33,954 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 19:03:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked.
[2024-11-08 19:03:36,488 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 19:03:40,456 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 19:03:40,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005790158]
[2024-11-08 19:03:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005790158] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 19:03:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272261785]
[2024-11-08 19:03:40,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:40,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 19:03:40,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 19:03:40,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 19:03:40,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-08 19:03:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:41,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 19:03:41,317 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 19:03:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2024-11-08 19:03:43,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 19:03:43,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272261785] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:03:43,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 19:03:43,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9
[2024-11-08 19:03:43,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387807126]
[2024-11-08 19:03:43,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:03:43,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 19:03:43,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 19:03:43,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 19:03:43,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2024-11-08 19:03:43,126 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:45,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 19:03:49,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 19:03:54,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 19:03:55,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 19:03:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:55,965 INFO L93 Difference]: Finished difference Result 177 states and 251 transitions.
[2024-11-08 19:03:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 19:03:55,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119
[2024-11-08 19:03:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:55,973 INFO L225 Difference]: With dead ends: 177
[2024-11-08 19:03:55,973 INFO L226 Difference]: Without dead ends: 126
[2024-11-08 19:03:55,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2024-11-08 19:03:55,975 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 45 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time
[2024-11-08 19:03:55,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 197 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 1 Unknown, 0 Unchecked, 12.8s Time]
[2024-11-08 19:03:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2024-11-08 19:03:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121.
[2024-11-08 19:03:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38)
[2024-11-08 19:03:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions.
[2024-11-08 19:03:56,003 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 119
[2024-11-08 19:03:56,004 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:56,004 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions.
[2024-11-08 19:03:56,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2024-11-08 19:03:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions.
[2024-11-08 19:03:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-08 19:03:56,007 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:56,007 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:56,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-08 19:03:56,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2024-11-08 19:03:56,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 19:03:56,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:56,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1483015384, now seen corresponding path program 1 times
[2024-11-08 19:03:56,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 19:03:56,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459609176]
[2024-11-08 19:03:56,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:03:56,414 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 19:03:56,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 19:03:56,418 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/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 19:03:56,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c09a9d61-4614-4a78-8a98-f0c72151ece2/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-11-08 19:03:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:03:57,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 51 conjuncts are in the unsatisfiable core
[2024-11-08 19:03:57,502 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 19:04:46,561 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:04:52,448 WARN L286 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:05:00,511 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:05:06,709 WARN L286 SmtUtils]: Spent 6.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:05:12,744 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:05:20,847 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:05:27,842 WARN L286 SmtUtils]: Spent 6.99s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:05:35,915 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:05:43,355 WARN L286 SmtUtils]: Spent 7.44s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:05:51,448 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:05:56,621 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:06:02,380 WARN L286 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:06:10,477 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:06:18,213 WARN L286 SmtUtils]: Spent 7.71s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:06:26,323 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:06:34,378 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:06:42,456 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:06:50,566 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:06:57,522 WARN L286 SmtUtils]: Spent 6.96s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:07:04,401 WARN L286 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:07:12,529 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:07:18,790 WARN L286 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:07:26,933 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:07:39,071 WARN L286 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:07:46,320 WARN L286 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:07:58,351 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:08:14,003 WARN L286 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:12:58,558 WARN L286 SmtUtils]: Spent 3.63m on a formula simplification that was a NOOP. DAG size: 86 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 19:13:06,724 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:13:13,964 WARN L286 SmtUtils]: Spent 7.24s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:13:21,887 WARN L286 SmtUtils]: Spent 7.92s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:13:30,001 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:13:38,112 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:13:46,219 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:13:54,373 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:14:00,522 WARN L286 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:14:08,600 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:14:15,118 WARN L286 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:14:23,237 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:14:31,370 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:14:39,466 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:14:46,935 WARN L286 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:14:54,561 WARN L286 SmtUtils]: Spent 7.62s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:15:02,641 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:15:09,430 WARN L286 SmtUtils]: Spent 6.79s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:15:17,453 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:15:25,543 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:15:33,672 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:15:41,595 WARN L286 SmtUtils]: Spent 7.92s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:15:49,663 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:15:57,733 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:16:05,830 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:16:12,233 WARN L286 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:16:19,883 WARN L286 SmtUtils]: Spent 7.65s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:16:26,364 WARN L286 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:16:34,453 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:16:41,326 WARN L286 SmtUtils]: Spent 6.87s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:16:49,424 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:16:56,236 WARN L286 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:17:04,330 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:17:12,348 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:17:20,405 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:17:28,504 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:17:36,262 WARN L286 SmtUtils]: Spent 7.76s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:17:44,358 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:17:48,387 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_19~0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse5 ((_ zero_extend 24) c_~var_1_5~0)) (.cse8 ((_ sign_extend 24) c_~var_1_17~0)) (.cse1 ((_ sign_extend 24) c_~var_1_18~0))) (and (bvsge .cse0 (_ bv4294967265 32)) (bvsle .cse1 (_ bv32 32)) (let ((.cse3 (bvadd (_ bv10 32) .cse5)) (.cse4 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse2 (bvsgt .cse3 .cse4))) (or (and .cse2 (= ((_ extract 15 0) .cse3) c_~var_1_20~0)) (and (= ((_ extract 15 0) .cse4) c_~var_1_20~0) (not .cse2))))) (= (_ bv0 16) c_~var_1_21~0) (fp.leq c_~var_1_12~0 .cse6) (fp.geq c_~var_1_14~0 .cse7) (bvsle .cse0 (_ bv31 32)) (fp.leq c_~var_1_14~0 .cse6) (fp.geq c_~var_1_13~0 .cse7) (fp.geq c_~var_1_12~0 .cse7) (fp.leq c_~var_1_13~0 .cse6) (bvsge .cse8 (_ bv4294967233 32)) (let ((.cse9 (bvslt .cse0 (_ bv0 32)))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) (bvadd .cse0 .cse8 .cse1))) (not .cse9)) (and (= ((_ extract 7 0) (bvadd .cse8 .cse1 (bvneg .cse0))) c_~var_1_16~0) .cse9))) (let ((.cse10 (fp.gt c_~var_1_10~0 c_~var_1_11~0)) (.cse11 (fp.sub c_currentRoundingMode c_~var_1_13~0 c_~var_1_14~0))) (or (and .cse10 (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_10~0 c_~var_1_12~0) .cse11))) (and (not .cse10) (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) .cse11))))) (fp.leq c_~var_1_11~0 .cse6) (fp.geq c_~var_1_11~0 .cse7) (let ((.cse12 ((_ sign_extend 24) c_~var_1_16~0))) (let ((.cse13 (bvslt .cse12 (_ bv0 32)))) (or (and (= c_~var_1_1~0 (bvneg .cse12)) .cse13) (and (not .cse13) (= .cse12 c_~var_1_1~0))))) (bvslt (_ bv64 32) (bvsrem .cse5 c_~var_1_9~0)) (not (bvsgt (_ bv32 32) c_~var_1_9~0)) (bvsle .cse8 (_ bv63 32)) (= c_~var_1_3~0 (_ bv64 8)) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv10 16) c_~var_1_6~0) (= (_ bv0 16) c_~last_1_var_1_21~0) (bvsge .cse1 (_ bv4294967265 32)))) is different from false
[2024-11-08 19:17:55,944 WARN L286 SmtUtils]: Spent 7.44s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)