./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-51.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash abdeae89f68926168a979793b9e178793666804156bbffb81f0dbc32b2012e6a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:40:52,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:40:52,367 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:40:52,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:40:52,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:40:52,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:40:52,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:40:52,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:40:52,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:40:52,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:40:52,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:40:52,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:40:52,401 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:40:52,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:40:52,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:40:52,402 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:40:52,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:40:52,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:40:52,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:40:52,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:40:52,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:40:52,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:40:52,409 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:40:52,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:40:52,410 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:40:52,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:40:52,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:40:52,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:40:52,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:40:52,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:40:52,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:40:52,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:40:52,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:40:52,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:40:52,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:40:52,420 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:40:52,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:40:52,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:40:52,421 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:40:52,421 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_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> abdeae89f68926168a979793b9e178793666804156bbffb81f0dbc32b2012e6a [2023-11-19 07:40:52,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:40:52,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:40:52,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:40:52,791 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:40:52,792 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:40:52,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-51.i [2023-11-19 07:40:55,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:40:56,281 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:40:56,282 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-51.i [2023-11-19 07:40:56,295 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/data/c7b905dce/e9d7eeb66b8e449983f753f2f2d1ee0b/FLAGfb7756cc4 [2023-11-19 07:40:56,317 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/data/c7b905dce/e9d7eeb66b8e449983f753f2f2d1ee0b [2023-11-19 07:40:56,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:40:56,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:40:56,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:40:56,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:40:56,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:40:56,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eca7a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56, skipping insertion in model container [2023-11-19 07:40:56,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,395 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:40:56,602 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-51.i[915,928] [2023-11-19 07:40:56,660 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:40:56,674 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:40:56,688 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-51.i[915,928] [2023-11-19 07:40:56,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:40:56,743 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:40:56,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56 WrapperNode [2023-11-19 07:40:56,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:40:56,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:40:56,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:40:56,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:40:56,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,850 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2023-11-19 07:40:56,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:40:56,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:40:56,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:40:56,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:40:56,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:40:56,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:40:56,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:40:56,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:40:56,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56" (1/1) ... [2023-11-19 07:40:56,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:40:56,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:40:56,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:40:56,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:40:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:40:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:40:57,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:40:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:40:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:40:57,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:40:57,137 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:40:57,141 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:40:57,598 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:40:57,617 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:40:57,618 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:40:57,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:57 BoogieIcfgContainer [2023-11-19 07:40:57,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:40:57,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:40:57,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:40:57,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:40:57,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:40:56" (1/3) ... [2023-11-19 07:40:57,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3fd8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:40:57, skipping insertion in model container [2023-11-19 07:40:57,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:56" (2/3) ... [2023-11-19 07:40:57,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3fd8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:40:57, skipping insertion in model container [2023-11-19 07:40:57,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:57" (3/3) ... [2023-11-19 07:40:57,630 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-51.i [2023-11-19 07:40:57,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:40:57,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:40:57,697 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:40:57,704 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@67802ae2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:40:57,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:40:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:40:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-19 07:40:57,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:57,728 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:57,729 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:57,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:57,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1740960990, now seen corresponding path program 1 times [2023-11-19 07:40:57,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:57,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099133050] [2023-11-19 07:40:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:57,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:40:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:40:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:40:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:40:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:40:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:40:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:40:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:40:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:40:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:40:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:40:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:40:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 07:40:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 07:40:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:40:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 07:40:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:40:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-19 07:40:58,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:58,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099133050] [2023-11-19 07:40:58,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099133050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:58,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:58,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:40:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143911607] [2023-11-19 07:40:58,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:58,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:40:58,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:58,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:40:58,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:40:58,452 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-19 07:40:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:58,497 INFO L93 Difference]: Finished difference Result 127 states and 219 transitions. [2023-11-19 07:40:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:40:58,500 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2023-11-19 07:40:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:58,509 INFO L225 Difference]: With dead ends: 127 [2023-11-19 07:40:58,510 INFO L226 Difference]: Without dead ends: 63 [2023-11-19 07:40:58,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:40:58,518 INFO L413 NwaCegarLoop]: 95 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, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:58,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:40:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-19 07:40:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-19 07:40:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:40:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2023-11-19 07:40:58,579 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 135 [2023-11-19 07:40:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:58,580 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2023-11-19 07:40:58,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-19 07:40:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2023-11-19 07:40:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-19 07:40:58,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:58,585 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:58,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:40:58,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:58,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:58,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1440285028, now seen corresponding path program 1 times [2023-11-19 07:40:58,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:58,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459585344] [2023-11-19 07:40:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:58,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:40:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:40:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:40:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:40:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:40:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:40:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:40:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:40:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:40:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:40:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:40:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:40:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 07:40:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 07:40:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:40:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 07:40:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:40:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-19 07:40:59,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:59,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459585344] [2023-11-19 07:40:59,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459585344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:59,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:59,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:40:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750447864] [2023-11-19 07:40:59,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:59,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:40:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:59,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:40:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:40:59,367 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-19 07:40:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:59,654 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2023-11-19 07:40:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:40:59,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2023-11-19 07:40:59,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:59,658 INFO L225 Difference]: With dead ends: 184 [2023-11-19 07:40:59,658 INFO L226 Difference]: Without dead ends: 124 [2023-11-19 07:40:59,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:40:59,661 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 71 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:59,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 261 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:40:59,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-19 07:40:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2023-11-19 07:40:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-19 07:40:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2023-11-19 07:40:59,721 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 135 [2023-11-19 07:40:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:59,723 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2023-11-19 07:40:59,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-19 07:40:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2023-11-19 07:40:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-19 07:40:59,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:59,729 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:59,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:40:59,729 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:59,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash -810717471, now seen corresponding path program 1 times [2023-11-19 07:40:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:59,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367639995] [2023-11-19 07:40:59,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:59,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:41:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:41:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:41:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:41:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:41:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:41:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:41:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:41:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:41:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 07:41:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 07:41:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 07:41:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:41:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-19 07:41:00,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:00,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367639995] [2023-11-19 07:41:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367639995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:00,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:00,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:00,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678549268] [2023-11-19 07:41:00,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:00,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:00,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:00,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:00,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:00,441 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-19 07:41:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:00,710 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2023-11-19 07:41:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:00,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2023-11-19 07:41:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:00,715 INFO L225 Difference]: With dead ends: 230 [2023-11-19 07:41:00,715 INFO L226 Difference]: Without dead ends: 170 [2023-11-19 07:41:00,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:41:00,718 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 103 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:00,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 318 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:41:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-19 07:41:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2023-11-19 07:41:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-11-19 07:41:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 245 transitions. [2023-11-19 07:41:00,794 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 245 transitions. Word has length 136 [2023-11-19 07:41:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:00,795 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 245 transitions. [2023-11-19 07:41:00,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-19 07:41:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 245 transitions. [2023-11-19 07:41:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-19 07:41:00,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:00,799 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:00,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:41:00,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:00,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1205819797, now seen corresponding path program 1 times [2023-11-19 07:41:00,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:00,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353673129] [2023-11-19 07:41:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:00,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:41:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:41:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:41:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:41:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:41:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:41:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:41:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:41:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:41:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 07:41:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 07:41:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 07:41:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:41:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-19 07:41:01,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:01,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353673129] [2023-11-19 07:41:01,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353673129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:01,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:01,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:41:01,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799279083] [2023-11-19 07:41:01,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:01,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:41:01,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:01,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:41:01,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:41:01,173 INFO L87 Difference]: Start difference. First operand 161 states and 245 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-19 07:41:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:01,372 INFO L93 Difference]: Finished difference Result 397 states and 609 transitions. [2023-11-19 07:41:01,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:41:01,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 137 [2023-11-19 07:41:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:01,377 INFO L225 Difference]: With dead ends: 397 [2023-11-19 07:41:01,377 INFO L226 Difference]: Without dead ends: 279 [2023-11-19 07:41:01,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:01,380 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 77 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:01,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 244 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-19 07:41:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2023-11-19 07:41:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 166 states have internal predecessors, (214), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2023-11-19 07:41:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 424 transitions. [2023-11-19 07:41:01,445 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 424 transitions. Word has length 137 [2023-11-19 07:41:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:01,446 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 424 transitions. [2023-11-19 07:41:01,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-19 07:41:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 424 transitions. [2023-11-19 07:41:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-19 07:41:01,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:01,449 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:01,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:41:01,450 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:01,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash 812792787, now seen corresponding path program 1 times [2023-11-19 07:41:01,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:01,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655182475] [2023-11-19 07:41:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:01,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:41:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:41:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:41:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:41:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:41:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:41:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:41:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:41:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:41:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 07:41:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 07:41:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 07:41:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:41:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-19 07:41:01,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:01,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655182475] [2023-11-19 07:41:01,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655182475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:01,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:01,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:41:01,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487226355] [2023-11-19 07:41:01,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:01,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:41:01,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:01,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:41:01,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:41:01,699 INFO L87 Difference]: Start difference. First operand 277 states and 424 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-19 07:41:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:01,784 INFO L93 Difference]: Finished difference Result 511 states and 785 transitions. [2023-11-19 07:41:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:41:01,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2023-11-19 07:41:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:01,789 INFO L225 Difference]: With dead ends: 511 [2023-11-19 07:41:01,789 INFO L226 Difference]: Without dead ends: 277 [2023-11-19 07:41:01,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:41:01,792 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 20 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:01,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 158 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:41:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-11-19 07:41:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2023-11-19 07:41:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 166 states have (on average 1.2650602409638554) internal successors, (210), 166 states have internal predecessors, (210), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2023-11-19 07:41:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 420 transitions. [2023-11-19 07:41:01,852 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 420 transitions. Word has length 137 [2023-11-19 07:41:01,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:01,853 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 420 transitions. [2023-11-19 07:41:01,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-19 07:41:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 420 transitions. [2023-11-19 07:41:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-19 07:41:01,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:01,856 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:01,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:41:01,856 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:01,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:01,857 INFO L85 PathProgramCache]: Analyzing trace with hash 463284182, now seen corresponding path program 1 times [2023-11-19 07:41:01,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:01,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2558544] [2023-11-19 07:41:01,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:01,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:41:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:41:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:41:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:41:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:41:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:41:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:41:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:41:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:41:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 07:41:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 07:41:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 07:41:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:41:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-19 07:41:02,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:02,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2558544] [2023-11-19 07:41:02,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2558544] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:02,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925282279] [2023-11-19 07:41:02,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:02,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:02,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:02,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:02,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:41:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 07:41:02,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:02,611 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2023-11-19 07:41:02,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:41:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-19 07:41:02,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925282279] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:41:02,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:41:02,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-19 07:41:02,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144863984] [2023-11-19 07:41:02,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:41:02,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:41:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:02,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:41:02,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:41:02,838 INFO L87 Difference]: Start difference. First operand 277 states and 420 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2023-11-19 07:41:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:03,081 INFO L93 Difference]: Finished difference Result 425 states and 625 transitions. [2023-11-19 07:41:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:41:03,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 138 [2023-11-19 07:41:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:03,085 INFO L225 Difference]: With dead ends: 425 [2023-11-19 07:41:03,086 INFO L226 Difference]: Without dead ends: 307 [2023-11-19 07:41:03,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:41:03,088 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 46 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:03,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 153 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:41:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-11-19 07:41:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 173. [2023-11-19 07:41:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 103 states have (on average 1.203883495145631) internal successors, (124), 103 states have internal predecessors, (124), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-11-19 07:41:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2023-11-19 07:41:03,142 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 138 [2023-11-19 07:41:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:03,143 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2023-11-19 07:41:03,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2023-11-19 07:41:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2023-11-19 07:41:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-19 07:41:03,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:03,146 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:03,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 07:41:03,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:03,363 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:03,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 70257172, now seen corresponding path program 1 times [2023-11-19 07:41:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:03,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822968691] [2023-11-19 07:41:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:03,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:41:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:41:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:41:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:41:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:41:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:41:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:41:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:41:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:41:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 07:41:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 07:41:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 07:41:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:41:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-19 07:41:03,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:03,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822968691] [2023-11-19 07:41:03,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822968691] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:03,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747713831] [2023-11-19 07:41:03,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:03,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:03,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:03,984 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:04,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:41:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:04,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-19 07:41:04,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2023-11-19 07:41:04,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:41:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-19 07:41:04,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747713831] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:41:04,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:41:04,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 10 [2023-11-19 07:41:04,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710232898] [2023-11-19 07:41:04,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:41:04,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:41:04,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:04,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:41:04,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:41:04,663 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-19 07:41:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:05,538 INFO L93 Difference]: Finished difference Result 435 states and 605 transitions. [2023-11-19 07:41:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-19 07:41:05,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 138 [2023-11-19 07:41:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:05,542 INFO L225 Difference]: With dead ends: 435 [2023-11-19 07:41:05,542 INFO L226 Difference]: Without dead ends: 371 [2023-11-19 07:41:05,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 313 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2023-11-19 07:41:05,544 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 198 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:05,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 502 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:41:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-11-19 07:41:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 271. [2023-11-19 07:41:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 160 states have (on average 1.14375) internal successors, (183), 162 states have internal predecessors, (183), 97 states have call successors, (97), 13 states have call predecessors, (97), 13 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2023-11-19 07:41:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 377 transitions. [2023-11-19 07:41:05,635 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 377 transitions. Word has length 138 [2023-11-19 07:41:05,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:05,635 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 377 transitions. [2023-11-19 07:41:05,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-19 07:41:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 377 transitions. [2023-11-19 07:41:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-19 07:41:05,637 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:05,638 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:05,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:41:05,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:05,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:05,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2061646100, now seen corresponding path program 1 times [2023-11-19 07:41:05,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:05,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461504538] [2023-11-19 07:41:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:05,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:05,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:06,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:06,161 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:41:06,162 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:41:06,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:41:06,169 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:06,174 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:41:06,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:41:06 BoogieIcfgContainer [2023-11-19 07:41:06,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:41:06,333 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:41:06,333 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:41:06,333 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:41:06,333 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:57" (3/4) ... [2023-11-19 07:41:06,336 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:41:06,337 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:41:06,338 INFO L158 Benchmark]: Toolchain (without parser) took 10010.48ms. Allocated memory was 161.5MB in the beginning and 243.3MB in the end (delta: 81.8MB). Free memory was 128.7MB in the beginning and 96.5MB in the end (delta: 32.2MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. [2023-11-19 07:41:06,338 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 161.5MB. Free memory was 134.6MB in the beginning and 134.4MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:41:06,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.78ms. Allocated memory is still 161.5MB. Free memory was 128.7MB in the beginning and 114.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:41:06,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.92ms. Allocated memory is still 161.5MB. Free memory was 114.6MB in the beginning and 111.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:41:06,340 INFO L158 Benchmark]: Boogie Preprocessor took 41.41ms. Allocated memory is still 161.5MB. Free memory was 111.9MB in the beginning and 110.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:41:06,341 INFO L158 Benchmark]: RCFGBuilder took 728.16ms. Allocated memory is still 161.5MB. Free memory was 110.4MB in the beginning and 91.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-19 07:41:06,342 INFO L158 Benchmark]: TraceAbstraction took 8707.72ms. Allocated memory was 161.5MB in the beginning and 243.3MB in the end (delta: 81.8MB). Free memory was 91.0MB in the beginning and 96.5MB in the end (delta: -5.6MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. [2023-11-19 07:41:06,342 INFO L158 Benchmark]: Witness Printer took 4.65ms. Allocated memory is still 243.3MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:41:06,345 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.33ms. Allocated memory is still 161.5MB. Free memory was 134.6MB in the beginning and 134.4MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.78ms. Allocated memory is still 161.5MB. Free memory was 128.7MB in the beginning and 114.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.92ms. Allocated memory is still 161.5MB. Free memory was 114.6MB in the beginning and 111.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.41ms. Allocated memory is still 161.5MB. Free memory was 111.9MB in the beginning and 110.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 728.16ms. Allocated memory is still 161.5MB. Free memory was 110.4MB in the beginning and 91.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8707.72ms. Allocated memory was 161.5MB in the beginning and 243.3MB in the end (delta: 81.8MB). Free memory was 91.0MB in the beginning and 96.5MB in the end (delta: -5.6MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. * Witness Printer took 4.65ms. Allocated memory is still 243.3MB. Free memory is still 96.5MB. 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 141, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char last_1_var_1_1 = 128; [L41] unsigned long int last_1_var_1_12 = 8; [L42] double last_1_var_1_17 = 256.8; [L43] unsigned char last_1_var_1_21 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] CALL updateLastVariables() [L135] last_1_var_1_1 = var_1_1 [L136] last_1_var_1_12 = var_1_12 [L137] last_1_var_1_17 = var_1_17 [L138] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L148] RET updateLastVariables() [L149] CALL updateVariables() [L100] var_1_4 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=5] [L106] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=5] [L106] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=5] [L107] var_1_9 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L108] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L109] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L109] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L110] var_1_10 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L111] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L112] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L112] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L113] var_1_11 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L115] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L115] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L116] var_1_13 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L117] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L118] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L118] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L119] var_1_15 = __VERIFIER_nondet_ulong() [L120] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L120] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L121] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L121] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L122] var_1_18 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L123] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L124] var_1_22 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L125] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L126] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L126] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L127] var_1_23 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L128] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L129] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L129] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L130] var_1_24 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L131] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L132] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L132] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L149] RET updateVariables() [L150] CALL step() [L47] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L48] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L49] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L50] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L57] unsigned long int stepLocal_1 = last_1_var_1_12; [L58] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L59] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L60] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L61] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L68] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L71] COND TRUE ! (var_1_17 > var_1_5) [L72] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L76] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, stepLocal_4=128, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L77] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L88] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, stepLocal_4=128, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L90] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_2=0, stepLocal_3=1, stepLocal_4=128, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L91] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_2=0, stepLocal_3=1, stepLocal_4=128, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L94] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_2=0, stepLocal_3=1, stepLocal_4=128, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 559 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 515 mSDsluCounter, 1731 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1094 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 711 IncrementalHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 637 mSDtfsCounter, 711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 920 GetRequests, 871 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=4, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 266 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1497 ConstructedInterpolants, 0 QuantifiedInterpolants, 3264 SizeOfPredicates, 9 NumberOfNonLiveVariables, 676 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 9114/9240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 07:41:06,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-51.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash abdeae89f68926168a979793b9e178793666804156bbffb81f0dbc32b2012e6a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:41:09,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:41:09,321 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-19 07:41:09,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:41:09,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:41:09,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:41:09,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:41:09,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:41:09,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:41:09,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:41:09,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:41:09,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:41:09,393 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:41:09,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:41:09,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:41:09,397 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:41:09,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:41:09,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:41:09,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:41:09,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:41:09,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:41:09,400 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:41:09,401 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:41:09,401 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:41:09,402 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:41:09,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:41:09,403 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:41:09,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:41:09,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:41:09,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:41:09,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:41:09,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:41:09,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:41:09,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:41:09,407 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:41:09,408 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:41:09,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:41:09,408 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:41:09,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:41:09,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:41:09,410 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:41:09,410 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:41:09,410 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_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> abdeae89f68926168a979793b9e178793666804156bbffb81f0dbc32b2012e6a [2023-11-19 07:41:09,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:41:09,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:41:09,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:41:09,846 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:41:09,848 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:41:09,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-51.i [2023-11-19 07:41:12,907 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:41:13,208 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:41:13,209 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-51.i [2023-11-19 07:41:13,222 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/data/a6184a239/9c75ca3739c94f15a3b1c8ee847c4bae/FLAG6e03f23ed [2023-11-19 07:41:13,239 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/data/a6184a239/9c75ca3739c94f15a3b1c8ee847c4bae [2023-11-19 07:41:13,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:41:13,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:41:13,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:41:13,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:41:13,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:41:13,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4a273b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13, skipping insertion in model container [2023-11-19 07:41:13,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,302 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:41:13,512 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-51.i[915,928] [2023-11-19 07:41:13,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:41:13,640 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:41:13,657 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-51.i[915,928] [2023-11-19 07:41:13,729 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:41:13,749 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:41:13,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13 WrapperNode [2023-11-19 07:41:13,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:41:13,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:41:13,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:41:13,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:41:13,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,841 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2023-11-19 07:41:13,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:41:13,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:41:13,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:41:13,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:41:13,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:41:13,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:41:13,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:41:13,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:41:13,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13" (1/1) ... [2023-11-19 07:41:13,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:41:13,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:13,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:41:13,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:41:14,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:41:14,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:41:14,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:41:14,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:41:14,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:41:14,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:41:14,169 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:41:14,189 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:41:19,530 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:41:19,541 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:41:19,541 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:41:19,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:19 BoogieIcfgContainer [2023-11-19 07:41:19,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:41:19,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:41:19,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:41:19,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:41:19,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:41:13" (1/3) ... [2023-11-19 07:41:19,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f3c2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:19, skipping insertion in model container [2023-11-19 07:41:19,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:13" (2/3) ... [2023-11-19 07:41:19,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f3c2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:19, skipping insertion in model container [2023-11-19 07:41:19,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:19" (3/3) ... [2023-11-19 07:41:19,555 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-51.i [2023-11-19 07:41:19,574 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:41:19,574 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:41:19,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:41:19,634 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f6d5e3d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:41:19,634 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:41:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:41:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-19 07:41:19,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:19,652 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:19,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:19,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1740960990, now seen corresponding path program 1 times [2023-11-19 07:41:19,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:41:19,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090221069] [2023-11-19 07:41:19,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:19,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:41:19,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:41:19,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:41:19,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-19 07:41:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:20,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 07:41:20,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2023-11-19 07:41:20,799 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:41:20,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:41:20,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090221069] [2023-11-19 07:41:20,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090221069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:20,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:20,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:41:20,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010457747] [2023-11-19 07:41:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:20,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:41:20,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:41:20,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:41:20,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:41:20,864 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-19 07:41:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:20,907 INFO L93 Difference]: Finished difference Result 127 states and 219 transitions. [2023-11-19 07:41:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:41:20,909 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2023-11-19 07:41:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:20,918 INFO L225 Difference]: With dead ends: 127 [2023-11-19 07:41:20,918 INFO L226 Difference]: Without dead ends: 63 [2023-11-19 07:41:20,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:41:20,926 INFO L413 NwaCegarLoop]: 95 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, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:20,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:41:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-19 07:41:20,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-19 07:41:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:41:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2023-11-19 07:41:20,992 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 135 [2023-11-19 07:41:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:20,993 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2023-11-19 07:41:20,993 INFO L496 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-19 07:41:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2023-11-19 07:41:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-19 07:41:20,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:20,998 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:21,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:41:21,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:41:21,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:21,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:21,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1440285028, now seen corresponding path program 1 times [2023-11-19 07:41:21,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:41:21,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112865111] [2023-11-19 07:41:21,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:21,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:41:21,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:41:21,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:41:21,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-19 07:41:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:22,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:41:22,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-19 07:41:24,518 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:41:24,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:41:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112865111] [2023-11-19 07:41:24,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112865111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:24,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:24,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:41:24,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390654121] [2023-11-19 07:41:24,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:24,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:41:24,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:41:24,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:41:24,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:41:24,525 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-19 07:41:27,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:41:29,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:41:31,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:41:33,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:41:36,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:41:38,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:41:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:38,067 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2023-11-19 07:41:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:38,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2023-11-19 07:41:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:38,164 INFO L225 Difference]: With dead ends: 184 [2023-11-19 07:41:38,164 INFO L226 Difference]: Without dead ends: 124 [2023-11-19 07:41:38,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:38,167 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 43 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:38,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 262 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 13.4s Time] [2023-11-19 07:41:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-19 07:41:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2023-11-19 07:41:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-19 07:41:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2023-11-19 07:41:38,214 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 135 [2023-11-19 07:41:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:38,215 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2023-11-19 07:41:38,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-19 07:41:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2023-11-19 07:41:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-19 07:41:38,219 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:38,219 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:38,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:41:38,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:41:38,440 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:38,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:38,441 INFO L85 PathProgramCache]: Analyzing trace with hash -810717471, now seen corresponding path program 1 times [2023-11-19 07:41:38,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:41:38,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859683442] [2023-11-19 07:41:38,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:38,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:41:38,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:41:38,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:41:38,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4aa64e8-3950-4d04-aff5-c22987091b44/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-19 07:41:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:39,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 07:41:39,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-19 07:41:41,934 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:41:41,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:41:41,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859683442] [2023-11-19 07:41:41,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859683442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:41,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:41,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:41:41,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699811876] [2023-11-19 07:41:41,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:41,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:41,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:41:41,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:41,939 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-19 07:41:45,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:41:47,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:41:49,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:41:51,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []