./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd --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 c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:27:43,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:27:43,462 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:27:43,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:27:43,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:27:43,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:27:43,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:27:43,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:27:43,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:27:43,500 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:27:43,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:27:43,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:27:43,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:27:43,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:27:43,501 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:27:43,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:27:43,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:27:43,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:27:43,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:27:43,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:27:43,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:27:43,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:27:43,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:27:43,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:27:43,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:27:43,504 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:27:43,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:27:43,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:27:43,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:27:43,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:27:43,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:27:43,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:27:43,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:27:43,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:27:43,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:27:43,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:27:43,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:27:43,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:27:43,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:27:43,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:27:43,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:27:43,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:27:43,506 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd 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 -> c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec [2024-11-13 13:27:43,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:27:43,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:27:43,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:27:43,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:27:43,953 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:27:43,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i Unable to find full path for "g++" [2024-11-13 13:27:46,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:27:46,673 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:27:46,674 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i [2024-11-13 13:27:46,686 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/data/fcfdf088d/51b63b34261d4cf6b3918085318d147c/FLAGb39351d0f [2024-11-13 13:27:46,707 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/data/fcfdf088d/51b63b34261d4cf6b3918085318d147c [2024-11-13 13:27:46,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:27:46,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:27:46,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:27:46,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:27:46,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:27:46,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:27:46" (1/1) ... [2024-11-13 13:27:46,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d6115e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:46, skipping insertion in model container [2024-11-13 13:27:46,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:27:46" (1/1) ... [2024-11-13 13:27:46,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:27:46,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i[916,929] [2024-11-13 13:27:47,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:27:47,145 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:27:47,159 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i[916,929] [2024-11-13 13:27:47,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:27:47,290 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:27:47,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47 WrapperNode [2024-11-13 13:27:47,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:27:47,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:27:47,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:27:47,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:27:47,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (1/1) ... [2024-11-13 13:27:47,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (1/1) ... [2024-11-13 13:27:47,406 INFO L138 Inliner]: procedures = 30, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2024-11-13 13:27:47,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:27:47,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:27:47,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:27:47,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:27:47,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (1/1) ... [2024-11-13 13:27:47,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (1/1) ... [2024-11-13 13:27:47,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (1/1) ... [2024-11-13 13:27:47,438 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-13 13:27:47,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (1/1) ... [2024-11-13 13:27:47,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (1/1) ... [2024-11-13 13:27:47,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (1/1) ... [2024-11-13 13:27:47,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (1/1) ... [2024-11-13 13:27:47,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (1/1) ... [2024-11-13 13:27:47,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (1/1) ... [2024-11-13 13:27:47,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:27:47,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:27:47,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:27:47,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:27:47,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (1/1) ... [2024-11-13 13:27:47,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:27:47,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:27:47,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:27:47,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:27:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:27:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-13 13:27:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-13 13:27:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-13 13:27:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 13:27:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-13 13:27:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 13:27:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:27:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:27:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 13:27:47,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:27:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:27:47,821 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:27:47,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:27:48,635 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-13 13:27:48,637 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:27:48,655 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:27:48,658 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:27:48,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:27:48 BoogieIcfgContainer [2024-11-13 13:27:48,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:27:48,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:27:48,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:27:48,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:27:48,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:27:46" (1/3) ... [2024-11-13 13:27:48,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7328c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:27:48, skipping insertion in model container [2024-11-13 13:27:48,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:47" (2/3) ... [2024-11-13 13:27:48,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7328c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:27:48, skipping insertion in model container [2024-11-13 13:27:48,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:27:48" (3/3) ... [2024-11-13 13:27:48,676 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-2.i [2024-11-13 13:27:48,698 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:27:48,700 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-2.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:27:48,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:27:48,811 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7df4d1d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:27:48,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:27:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 13:27:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 13:27:48,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:48,839 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:48,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:27:48,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:48,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1321184754, now seen corresponding path program 1 times [2024-11-13 13:27:48,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:48,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133904930] [2024-11-13 13:27:48,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:48,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:27:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:27:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:27:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:27:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:27:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:27:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:27:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:27:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:27:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:27:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:27:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:27:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:27:49,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:27:49,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133904930] [2024-11-13 13:27:49,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133904930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:27:49,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:27:49,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:27:49,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266069369] [2024-11-13 13:27:49,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:27:49,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:27:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:27:49,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:27:49,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:27:49,536 INFO L87 Difference]: Start difference. First operand has 104 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 13:27:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:27:49,591 INFO L93 Difference]: Finished difference Result 201 states and 314 transitions. [2024-11-13 13:27:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:27:49,595 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-13 13:27:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:27:49,608 INFO L225 Difference]: With dead ends: 201 [2024-11-13 13:27:49,608 INFO L226 Difference]: Without dead ends: 100 [2024-11-13 13:27:49,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:27:49,621 INFO L432 NwaCegarLoop]: 147 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, 147 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:27:49,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:27:49,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-13 13:27:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-13 13:27:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 13:27:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2024-11-13 13:27:49,699 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 100 [2024-11-13 13:27:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:27:49,699 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2024-11-13 13:27:49,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 13:27:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2024-11-13 13:27:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 13:27:49,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:49,709 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:49,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:27:49,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:27:49,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1656572474, now seen corresponding path program 1 times [2024-11-13 13:27:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:49,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90195147] [2024-11-13 13:27:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:27:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:27:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:27:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:27:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:27:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:27:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:27:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:27:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:27:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:27:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:27:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:27:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:27:50,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:27:50,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90195147] [2024-11-13 13:27:50,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90195147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:27:50,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:27:50,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:27:50,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520210623] [2024-11-13 13:27:50,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:27:50,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:27:50,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:27:50,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:27:50,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:27:50,635 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:27:50,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:27:50,735 INFO L93 Difference]: Finished difference Result 199 states and 294 transitions. [2024-11-13 13:27:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:27:50,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-13 13:27:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:27:50,741 INFO L225 Difference]: With dead ends: 199 [2024-11-13 13:27:50,742 INFO L226 Difference]: Without dead ends: 102 [2024-11-13 13:27:50,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:27:50,746 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:27:50,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:27:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-13 13:27:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-13 13:27:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 88 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 13:27:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-11-13 13:27:50,771 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 100 [2024-11-13 13:27:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:27:50,773 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-11-13 13:27:50,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:27:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-11-13 13:27:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 13:27:50,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:50,777 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:50,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:27:50,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:27:50,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash 985384374, now seen corresponding path program 1 times [2024-11-13 13:27:50,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:50,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842357836] [2024-11-13 13:27:50,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:50,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:27:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:27:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:27:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:27:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:27:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:27:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:27:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:27:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:27:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:27:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:27:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:27:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:27:51,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:27:51,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842357836] [2024-11-13 13:27:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842357836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:27:51,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:27:51,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:27:51,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569312972] [2024-11-13 13:27:51,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:27:51,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:27:51,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:27:51,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:27:51,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:27:51,147 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:27:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:27:51,196 INFO L93 Difference]: Finished difference Result 202 states and 297 transitions. [2024-11-13 13:27:51,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:27:51,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-13 13:27:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:27:51,203 INFO L225 Difference]: With dead ends: 202 [2024-11-13 13:27:51,204 INFO L226 Difference]: Without dead ends: 103 [2024-11-13 13:27:51,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:27:51,208 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 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 [2024-11-13 13:27:51,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:27:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-13 13:27:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-13 13:27:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 89 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 13:27:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-11-13 13:27:51,225 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 103 [2024-11-13 13:27:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:27:51,226 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-11-13 13:27:51,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:27:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-11-13 13:27:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 13:27:51,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:51,233 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:51,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:27:51,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:27:51,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1665442744, now seen corresponding path program 1 times [2024-11-13 13:27:51,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:51,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241399529] [2024-11-13 13:27:51,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:51,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:27:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:27:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:27:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:27:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:27:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:27:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:27:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:27:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:27:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:27:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:27:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:27:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:27:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:27:55,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241399529] [2024-11-13 13:27:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241399529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:27:55,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:27:55,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 13:27:55,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30707379] [2024-11-13 13:27:55,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:27:55,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:27:55,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:27:55,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:27:55,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:27:55,191 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 13:27:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:27:56,589 INFO L93 Difference]: Finished difference Result 251 states and 365 transitions. [2024-11-13 13:27:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:27:56,590 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-11-13 13:27:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:27:56,592 INFO L225 Difference]: With dead ends: 251 [2024-11-13 13:27:56,592 INFO L226 Difference]: Without dead ends: 151 [2024-11-13 13:27:56,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:27:56,594 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 448 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:27:56,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 573 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 13:27:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-13 13:27:56,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 124. [2024-11-13 13:27:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 110 states have internal predecessors, (157), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 13:27:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 181 transitions. [2024-11-13 13:27:56,629 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 181 transitions. Word has length 103 [2024-11-13 13:27:56,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:27:56,633 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 181 transitions. [2024-11-13 13:27:56,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 13:27:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2024-11-13 13:27:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 13:27:56,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:56,636 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:56,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:27:56,636 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:27:56,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:56,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1383245873, now seen corresponding path program 1 times [2024-11-13 13:27:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:56,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404465043] [2024-11-13 13:27:56,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:56,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:27:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:27:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:27:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:27:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:27:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:27:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:27:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:27:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:27:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:27:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:27:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:27:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:27:56,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:27:56,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404465043] [2024-11-13 13:27:56,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404465043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:27:56,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:27:56,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:27:56,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320196847] [2024-11-13 13:27:56,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:27:56,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:27:56,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:27:56,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:27:56,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:27:56,993 INFO L87 Difference]: Start difference. First operand 124 states and 181 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:27:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:27:57,088 INFO L93 Difference]: Finished difference Result 302 states and 444 transitions. [2024-11-13 13:27:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:27:57,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-13 13:27:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:27:57,091 INFO L225 Difference]: With dead ends: 302 [2024-11-13 13:27:57,091 INFO L226 Difference]: Without dead ends: 181 [2024-11-13 13:27:57,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:27:57,095 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 60 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:27:57,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 289 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:27:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-13 13:27:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2024-11-13 13:27:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 134 states have (on average 1.4477611940298507) internal successors, (194), 134 states have internal predecessors, (194), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 13:27:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2024-11-13 13:27:57,138 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 103 [2024-11-13 13:27:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:27:57,138 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2024-11-13 13:27:57,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:27:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2024-11-13 13:27:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 13:27:57,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:57,144 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:57,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:27:57,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:27:57,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:57,145 INFO L85 PathProgramCache]: Analyzing trace with hash -647533245, now seen corresponding path program 1 times [2024-11-13 13:27:57,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:57,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777443746] [2024-11-13 13:27:57,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:27:57,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112004367] [2024-11-13 13:27:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:57,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:27:57,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:27:57,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:27:57,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:27:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:58,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 13:27:58,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:27:58,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2024-11-13 13:27:58,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2024-11-13 13:27:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:27:58,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:27:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:27:58,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777443746] [2024-11-13 13:27:58,845 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:27:58,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112004367] [2024-11-13 13:27:58,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112004367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:27:58,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:27:58,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:27:58,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268192534] [2024-11-13 13:27:58,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:27:58,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:27:58,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:27:58,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:27:58,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:27:58,849 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:27:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:27:59,184 INFO L93 Difference]: Finished difference Result 411 states and 608 transitions. [2024-11-13 13:27:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:27:59,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-13 13:27:59,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:27:59,187 INFO L225 Difference]: With dead ends: 411 [2024-11-13 13:27:59,188 INFO L226 Difference]: Without dead ends: 266 [2024-11-13 13:27:59,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:27:59,189 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 97 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:27:59,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 363 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:27:59,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-13 13:27:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 219. [2024-11-13 13:27:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 192 states have (on average 1.4270833333333333) internal successors, (274), 192 states have internal predecessors, (274), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:27:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 322 transitions. [2024-11-13 13:27:59,224 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 322 transitions. Word has length 105 [2024-11-13 13:27:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:27:59,225 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 322 transitions. [2024-11-13 13:27:59,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:27:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 322 transitions. [2024-11-13 13:27:59,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 13:27:59,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:59,227 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:59,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 13:27:59,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:27:59,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:27:59,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:59,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1594835416, now seen corresponding path program 1 times [2024-11-13 13:27:59,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:59,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443178193] [2024-11-13 13:27:59,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:59,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:28:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:28:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:28:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:28:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:28:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:28:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:28:00,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:00,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443178193] [2024-11-13 13:28:00,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443178193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:00,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:00,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:28:00,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067039380] [2024-11-13 13:28:00,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:00,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:28:00,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:00,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:28:00,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:28:00,260 INFO L87 Difference]: Start difference. First operand 219 states and 322 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:28:00,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:00,943 INFO L93 Difference]: Finished difference Result 428 states and 624 transitions. [2024-11-13 13:28:00,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:28:00,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-13 13:28:00,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:00,946 INFO L225 Difference]: With dead ends: 428 [2024-11-13 13:28:00,946 INFO L226 Difference]: Without dead ends: 283 [2024-11-13 13:28:00,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:28:00,947 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 203 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:00,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 341 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:28:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-13 13:28:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 229. [2024-11-13 13:28:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 202 states have (on average 1.4158415841584158) internal successors, (286), 202 states have internal predecessors, (286), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:28:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 334 transitions. [2024-11-13 13:28:00,990 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 334 transitions. Word has length 106 [2024-11-13 13:28:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:00,990 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 334 transitions. [2024-11-13 13:28:00,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:28:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 334 transitions. [2024-11-13 13:28:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 13:28:00,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:00,992 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:00,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:28:00,992 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:00,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:00,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1999067302, now seen corresponding path program 1 times [2024-11-13 13:28:00,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:00,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111019318] [2024-11-13 13:28:00,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:00,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:28:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:28:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:28:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:28:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:28:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:28:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:28:04,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:04,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111019318] [2024-11-13 13:28:04,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111019318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:04,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:04,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 13:28:04,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81881211] [2024-11-13 13:28:04,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:04,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:28:04,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:04,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:28:04,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:28:04,702 INFO L87 Difference]: Start difference. First operand 229 states and 334 transitions. Second operand has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 13:28:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:06,728 INFO L93 Difference]: Finished difference Result 432 states and 636 transitions. [2024-11-13 13:28:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:28:06,729 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 106 [2024-11-13 13:28:06,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:06,732 INFO L225 Difference]: With dead ends: 432 [2024-11-13 13:28:06,733 INFO L226 Difference]: Without dead ends: 277 [2024-11-13 13:28:06,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:28:06,734 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 271 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:06,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 553 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 13:28:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-13 13:28:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 265. [2024-11-13 13:28:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 237 states have (on average 1.4219409282700421) internal successors, (337), 237 states have internal predecessors, (337), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:28:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 385 transitions. [2024-11-13 13:28:06,798 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 385 transitions. Word has length 106 [2024-11-13 13:28:06,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:06,799 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 385 transitions. [2024-11-13 13:28:06,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 13:28:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 385 transitions. [2024-11-13 13:28:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 13:28:06,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:06,803 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:06,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:28:06,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:06,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1576365476, now seen corresponding path program 1 times [2024-11-13 13:28:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40187311] [2024-11-13 13:28:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:28:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:28:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:28:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:28:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:28:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:28:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:28:11,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:11,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40187311] [2024-11-13 13:28:11,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40187311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:11,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:11,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 13:28:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358236635] [2024-11-13 13:28:11,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:11,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:28:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:11,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:28:11,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:28:11,375 INFO L87 Difference]: Start difference. First operand 265 states and 385 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 13:28:14,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:14,883 INFO L93 Difference]: Finished difference Result 550 states and 803 transitions. [2024-11-13 13:28:14,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:28:14,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2024-11-13 13:28:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:14,887 INFO L225 Difference]: With dead ends: 550 [2024-11-13 13:28:14,887 INFO L226 Difference]: Without dead ends: 383 [2024-11-13 13:28:14,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2024-11-13 13:28:14,889 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 397 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:14,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 794 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 13:28:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-13 13:28:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 331. [2024-11-13 13:28:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 303 states have (on average 1.4422442244224423) internal successors, (437), 303 states have internal predecessors, (437), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:28:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 485 transitions. [2024-11-13 13:28:14,946 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 485 transitions. Word has length 106 [2024-11-13 13:28:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:14,947 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 485 transitions. [2024-11-13 13:28:14,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 13:28:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 485 transitions. [2024-11-13 13:28:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:28:14,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:14,950 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:14,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:28:14,950 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:14,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash 207330292, now seen corresponding path program 1 times [2024-11-13 13:28:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:14,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952713295] [2024-11-13 13:28:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:14,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:28:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:28:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:28:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:28:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:28:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:28:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:28:19,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:19,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952713295] [2024-11-13 13:28:19,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952713295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:19,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:19,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:28:19,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724943174] [2024-11-13 13:28:19,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:19,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 13:28:19,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:19,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 13:28:19,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:28:19,604 INFO L87 Difference]: Start difference. First operand 331 states and 485 transitions. Second operand has 13 states, 9 states have (on average 5.666666666666667) internal successors, (51), 13 states have internal predecessors, (51), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-13 13:28:22,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:22,075 INFO L93 Difference]: Finished difference Result 597 states and 888 transitions. [2024-11-13 13:28:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:28:22,076 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 5.666666666666667) internal successors, (51), 13 states have internal predecessors, (51), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) Word has length 108 [2024-11-13 13:28:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:22,079 INFO L225 Difference]: With dead ends: 597 [2024-11-13 13:28:22,079 INFO L226 Difference]: Without dead ends: 389 [2024-11-13 13:28:22,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:28:22,082 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 273 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:22,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 570 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 13:28:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-13 13:28:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 365. [2024-11-13 13:28:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 337 states have (on average 1.4451038575667656) internal successors, (487), 337 states have internal predecessors, (487), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:28:22,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 535 transitions. [2024-11-13 13:28:22,157 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 535 transitions. Word has length 108 [2024-11-13 13:28:22,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:22,158 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 535 transitions. [2024-11-13 13:28:22,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 5.666666666666667) internal successors, (51), 13 states have internal predecessors, (51), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-13 13:28:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 535 transitions. [2024-11-13 13:28:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:28:22,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:22,164 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:22,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:28:22,165 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:22,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:22,165 INFO L85 PathProgramCache]: Analyzing trace with hash -799711178, now seen corresponding path program 1 times [2024-11-13 13:28:22,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:22,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820619873] [2024-11-13 13:28:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:22,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:28:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:28:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:28:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:28:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:28:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:28:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:28:24,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:24,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820619873] [2024-11-13 13:28:24,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820619873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:24,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:24,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 13:28:24,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200838838] [2024-11-13 13:28:24,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:24,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:28:24,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:24,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:28:24,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:28:24,955 INFO L87 Difference]: Start difference. First operand 365 states and 535 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 13:28:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:26,383 INFO L93 Difference]: Finished difference Result 644 states and 944 transitions. [2024-11-13 13:28:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:28:26,384 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2024-11-13 13:28:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:26,387 INFO L225 Difference]: With dead ends: 644 [2024-11-13 13:28:26,389 INFO L226 Difference]: Without dead ends: 423 [2024-11-13 13:28:26,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:28:26,392 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 375 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:26,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 353 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 13:28:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-13 13:28:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 371. [2024-11-13 13:28:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 343 states have (on average 1.4489795918367347) internal successors, (497), 343 states have internal predecessors, (497), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:28:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 545 transitions. [2024-11-13 13:28:26,464 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 545 transitions. Word has length 108 [2024-11-13 13:28:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:26,467 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 545 transitions. [2024-11-13 13:28:26,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 13:28:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 545 transitions. [2024-11-13 13:28:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:28:26,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:26,469 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:26,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:28:26,469 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:26,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:26,470 INFO L85 PathProgramCache]: Analyzing trace with hash -98646600, now seen corresponding path program 1 times [2024-11-13 13:28:26,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:26,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609252707] [2024-11-13 13:28:26,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:26,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:28:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:28:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:28:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:28:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:28:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:28:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:28:31,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:31,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609252707] [2024-11-13 13:28:31,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609252707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:31,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:31,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 13:28:31,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642461253] [2024-11-13 13:28:31,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:31,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 13:28:31,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:31,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 13:28:31,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:28:31,665 INFO L87 Difference]: Start difference. First operand 371 states and 545 transitions. Second operand has 15 states, 12 states have (on average 4.25) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-13 13:28:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:34,285 INFO L93 Difference]: Finished difference Result 674 states and 994 transitions. [2024-11-13 13:28:34,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:28:34,286 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.25) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) Word has length 108 [2024-11-13 13:28:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:34,289 INFO L225 Difference]: With dead ends: 674 [2024-11-13 13:28:34,289 INFO L226 Difference]: Without dead ends: 447 [2024-11-13 13:28:34,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:28:34,291 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 478 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:34,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 733 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 13:28:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-13 13:28:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 393. [2024-11-13 13:28:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 365 states have (on average 1.4493150684931506) internal successors, (529), 365 states have internal predecessors, (529), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:28:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 577 transitions. [2024-11-13 13:28:34,350 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 577 transitions. Word has length 108 [2024-11-13 13:28:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:34,350 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 577 transitions. [2024-11-13 13:28:34,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.25) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-13 13:28:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 577 transitions. [2024-11-13 13:28:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:28:34,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:34,353 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:34,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:28:34,353 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:34,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:34,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1598108042, now seen corresponding path program 1 times [2024-11-13 13:28:34,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:34,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855525855] [2024-11-13 13:28:34,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:34,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:37,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:37,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:37,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:28:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:28:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:38,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:28:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:38,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:38,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:28:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:38,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:28:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:38,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:28:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:38,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:28:38,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:38,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855525855] [2024-11-13 13:28:38,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855525855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:38,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:38,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 13:28:38,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924274283] [2024-11-13 13:28:38,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:38,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:28:38,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:38,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:28:38,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:28:38,082 INFO L87 Difference]: Start difference. First operand 393 states and 577 transitions. Second operand has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 13:28:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:40,671 INFO L93 Difference]: Finished difference Result 706 states and 1042 transitions. [2024-11-13 13:28:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:28:40,672 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2024-11-13 13:28:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:40,676 INFO L225 Difference]: With dead ends: 706 [2024-11-13 13:28:40,676 INFO L226 Difference]: Without dead ends: 467 [2024-11-13 13:28:40,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:28:40,678 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 355 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:40,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 813 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 13:28:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-13 13:28:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 417. [2024-11-13 13:28:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 389 states have (on average 1.4473007712082262) internal successors, (563), 389 states have internal predecessors, (563), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:28:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 611 transitions. [2024-11-13 13:28:40,762 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 611 transitions. Word has length 108 [2024-11-13 13:28:40,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:40,763 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 611 transitions. [2024-11-13 13:28:40,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 13:28:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 611 transitions. [2024-11-13 13:28:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 13:28:40,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:40,766 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:40,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:28:40,767 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:40,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash -516571388, now seen corresponding path program 1 times [2024-11-13 13:28:40,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:40,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183195439] [2024-11-13 13:28:40,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:40,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:42,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:42,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:42,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:42,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:42,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:28:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:42,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:28:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:42,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:28:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:42,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:42,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:28:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:43,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:28:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:43,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:28:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:43,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:28:43,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:43,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183195439] [2024-11-13 13:28:43,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183195439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:43,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:43,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:28:43,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132031141] [2024-11-13 13:28:43,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:43,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:28:43,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:43,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:28:43,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:28:43,036 INFO L87 Difference]: Start difference. First operand 417 states and 611 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 13:28:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:44,426 INFO L93 Difference]: Finished difference Result 736 states and 1078 transitions. [2024-11-13 13:28:44,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:28:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2024-11-13 13:28:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:44,434 INFO L225 Difference]: With dead ends: 736 [2024-11-13 13:28:44,434 INFO L226 Difference]: Without dead ends: 483 [2024-11-13 13:28:44,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:28:44,436 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 326 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:44,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 455 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 13:28:44,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-13 13:28:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 432. [2024-11-13 13:28:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 404 states have (on average 1.438118811881188) internal successors, (581), 404 states have internal predecessors, (581), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:28:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 629 transitions. [2024-11-13 13:28:44,492 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 629 transitions. Word has length 109 [2024-11-13 13:28:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:44,493 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 629 transitions. [2024-11-13 13:28:44,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 13:28:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 629 transitions. [2024-11-13 13:28:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 13:28:44,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:44,496 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:44,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:28:44,496 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:44,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1103377402, now seen corresponding path program 1 times [2024-11-13 13:28:44,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:44,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520840710] [2024-11-13 13:28:44,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:44,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:28:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:28:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:28:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:28:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:28:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:28:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:28:45,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:45,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520840710] [2024-11-13 13:28:45,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520840710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:45,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:45,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 13:28:45,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776070144] [2024-11-13 13:28:45,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:45,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:28:45,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:45,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:28:45,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:28:45,646 INFO L87 Difference]: Start difference. First operand 432 states and 629 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:28:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:46,771 INFO L93 Difference]: Finished difference Result 745 states and 1086 transitions. [2024-11-13 13:28:46,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:28:46,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-13 13:28:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:46,775 INFO L225 Difference]: With dead ends: 745 [2024-11-13 13:28:46,775 INFO L226 Difference]: Without dead ends: 483 [2024-11-13 13:28:46,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:28:46,777 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 186 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:46,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 527 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 13:28:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-13 13:28:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 429. [2024-11-13 13:28:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 401 states have (on average 1.4438902743142146) internal successors, (579), 401 states have internal predecessors, (579), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:28:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 627 transitions. [2024-11-13 13:28:46,828 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 627 transitions. Word has length 109 [2024-11-13 13:28:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:46,829 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 627 transitions. [2024-11-13 13:28:46,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:28:46,829 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2024-11-13 13:28:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 13:28:46,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:46,831 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:46,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:28:46,831 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:46,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash -402312824, now seen corresponding path program 1 times [2024-11-13 13:28:46,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:46,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789143987] [2024-11-13 13:28:46,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:46,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:28:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:28:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:28:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:28:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:28:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:28:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:28:49,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:49,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789143987] [2024-11-13 13:28:49,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789143987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:49,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:49,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 13:28:49,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614478308] [2024-11-13 13:28:49,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:49,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 13:28:49,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:49,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 13:28:49,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:28:49,530 INFO L87 Difference]: Start difference. First operand 429 states and 627 transitions. Second operand has 14 states, 10 states have (on average 5.2) internal successors, (52), 14 states have internal predecessors, (52), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-13 13:28:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:51,634 INFO L93 Difference]: Finished difference Result 682 states and 1005 transitions. [2024-11-13 13:28:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:28:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 5.2) internal successors, (52), 14 states have internal predecessors, (52), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) Word has length 109 [2024-11-13 13:28:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:51,637 INFO L225 Difference]: With dead ends: 682 [2024-11-13 13:28:51,638 INFO L226 Difference]: Without dead ends: 417 [2024-11-13 13:28:51,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:28:51,639 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 334 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:51,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 600 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 13:28:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-13 13:28:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2024-11-13 13:28:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 389 states have (on average 1.437017994858612) internal successors, (559), 389 states have internal predecessors, (559), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:28:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 607 transitions. [2024-11-13 13:28:51,693 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 607 transitions. Word has length 109 [2024-11-13 13:28:51,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:51,694 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 607 transitions. [2024-11-13 13:28:51,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 5.2) internal successors, (52), 14 states have internal predecessors, (52), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-13 13:28:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 607 transitions. [2024-11-13 13:28:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 13:28:51,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:51,697 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 13:28:51,697 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash 481583954, now seen corresponding path program 1 times [2024-11-13 13:28:51,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890305865] [2024-11-13 13:28:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:28:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:28:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:28:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:28:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:28:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:28:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:28:52,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:52,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890305865] [2024-11-13 13:28:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890305865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:52,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:52,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:28:52,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917383270] [2024-11-13 13:28:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:52,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:28:52,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:52,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:28:52,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:28:52,734 INFO L87 Difference]: Start difference. First operand 417 states and 607 transitions. Second operand has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 13:28:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:53,581 INFO L93 Difference]: Finished difference Result 700 states and 1026 transitions. [2024-11-13 13:28:53,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:28:53,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 110 [2024-11-13 13:28:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:53,587 INFO L225 Difference]: With dead ends: 700 [2024-11-13 13:28:53,587 INFO L226 Difference]: Without dead ends: 417 [2024-11-13 13:28:53,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:28:53,590 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 120 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:53,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 447 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:28:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-13 13:28:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2024-11-13 13:28:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 389 states have (on average 1.4318766066838047) internal successors, (557), 389 states have internal predecessors, (557), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:28:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 605 transitions. [2024-11-13 13:28:53,646 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 605 transitions. Word has length 110 [2024-11-13 13:28:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:53,648 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 605 transitions. [2024-11-13 13:28:53,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 13:28:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 605 transitions. [2024-11-13 13:28:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 13:28:53,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:53,650 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:53,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:28:53,651 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:53,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1323854380, now seen corresponding path program 1 times [2024-11-13 13:28:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977978901] [2024-11-13 13:28:53,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:53,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:28:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:28:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:28:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:28:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:28:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:28:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:28:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:28:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:28:58,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:58,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977978901] [2024-11-13 13:28:58,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977978901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:58,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:58,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-13 13:28:58,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699164663] [2024-11-13 13:28:58,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:58,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:28:58,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:58,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:28:58,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:28:58,136 INFO L87 Difference]: Start difference. First operand 417 states and 605 transitions. Second operand has 22 states, 20 states have (on average 2.65) internal successors, (53), 22 states have internal predecessors, (53), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 13:29:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:02,413 INFO L93 Difference]: Finished difference Result 786 states and 1141 transitions. [2024-11-13 13:29:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:29:02,414 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.65) internal successors, (53), 22 states have internal predecessors, (53), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 110 [2024-11-13 13:29:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:02,418 INFO L225 Difference]: With dead ends: 786 [2024-11-13 13:29:02,418 INFO L226 Difference]: Without dead ends: 533 [2024-11-13 13:29:02,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2024-11-13 13:29:02,420 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 197 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 2210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:02,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1697 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2210 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-13 13:29:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-13 13:29:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 477. [2024-11-13 13:29:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 449 states have (on average 1.4365256124721604) internal successors, (645), 449 states have internal predecessors, (645), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:29:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 693 transitions. [2024-11-13 13:29:02,476 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 693 transitions. Word has length 110 [2024-11-13 13:29:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:02,476 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 693 transitions. [2024-11-13 13:29:02,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.65) internal successors, (53), 22 states have internal predecessors, (53), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-13 13:29:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 693 transitions. [2024-11-13 13:29:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 13:29:02,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:02,479 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:02,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:29:02,479 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:02,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1824234441, now seen corresponding path program 1 times [2024-11-13 13:29:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660984772] [2024-11-13 13:29:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:02,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:09,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:29:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:09,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:29:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:29:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:29:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:29:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:09,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:29:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:10,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:29:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:10,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:29:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:10,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:29:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:10,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:29:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:10,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:29:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:10,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:29:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:29:10,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:10,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660984772] [2024-11-13 13:29:10,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660984772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:10,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:10,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 13:29:10,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492209189] [2024-11-13 13:29:10,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:10,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:29:10,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:10,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:29:10,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:29:10,105 INFO L87 Difference]: Start difference. First operand 477 states and 693 transitions. Second operand has 19 states, 14 states have (on average 3.857142857142857) internal successors, (54), 19 states have internal predecessors, (54), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-13 13:29:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:13,759 INFO L93 Difference]: Finished difference Result 818 states and 1195 transitions. [2024-11-13 13:29:13,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:29:13,760 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 3.857142857142857) internal successors, (54), 19 states have internal predecessors, (54), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 7 states have call successors, (12) Word has length 111 [2024-11-13 13:29:13,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:13,763 INFO L225 Difference]: With dead ends: 818 [2024-11-13 13:29:13,763 INFO L226 Difference]: Without dead ends: 531 [2024-11-13 13:29:13,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-11-13 13:29:13,765 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 447 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:13,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 877 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 13:29:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-13 13:29:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 477. [2024-11-13 13:29:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 449 states have (on average 1.4365256124721604) internal successors, (645), 449 states have internal predecessors, (645), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:29:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 693 transitions. [2024-11-13 13:29:13,813 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 693 transitions. Word has length 111 [2024-11-13 13:29:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:13,814 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 693 transitions. [2024-11-13 13:29:13,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 3.857142857142857) internal successors, (54), 19 states have internal predecessors, (54), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-13 13:29:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 693 transitions. [2024-11-13 13:29:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 13:29:13,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:13,816 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:13,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 13:29:13,816 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:13,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1237428427, now seen corresponding path program 1 times [2024-11-13 13:29:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:13,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462192636] [2024-11-13 13:29:13,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:13,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:29:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:29:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:29:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:29:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:29:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:29:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:29:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:29:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:29:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:29:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:29:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:29:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:29:15,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:15,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462192636] [2024-11-13 13:29:15,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462192636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:15,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:15,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:29:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007833130] [2024-11-13 13:29:15,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:15,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 13:29:15,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:15,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 13:29:15,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:29:15,091 INFO L87 Difference]: Start difference. First operand 477 states and 693 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 13:29:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:16,151 INFO L93 Difference]: Finished difference Result 902 states and 1308 transitions. [2024-11-13 13:29:16,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:29:16,152 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2024-11-13 13:29:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:16,154 INFO L225 Difference]: With dead ends: 902 [2024-11-13 13:29:16,154 INFO L226 Difference]: Without dead ends: 615 [2024-11-13 13:29:16,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-13 13:29:16,158 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 411 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:16,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 546 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:29:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-13 13:29:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 562. [2024-11-13 13:29:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 526 states have (on average 1.4258555133079849) internal successors, (750), 527 states have internal predecessors, (750), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-13 13:29:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 810 transitions. [2024-11-13 13:29:16,234 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 810 transitions. Word has length 111 [2024-11-13 13:29:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:16,234 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 810 transitions. [2024-11-13 13:29:16,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 13:29:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 810 transitions. [2024-11-13 13:29:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 13:29:16,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:16,236 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:16,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 13:29:16,236 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:16,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1938493005, now seen corresponding path program 1 times [2024-11-13 13:29:16,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:16,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261082997] [2024-11-13 13:29:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:29:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:29:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:29:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:29:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:29:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:29:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:29:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:29:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:29:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:29:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:29:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:29:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:29:21,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:21,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261082997] [2024-11-13 13:29:21,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261082997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:21,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:21,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 13:29:21,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216072632] [2024-11-13 13:29:21,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:21,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 13:29:21,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:21,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:29:21,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:29:21,245 INFO L87 Difference]: Start difference. First operand 562 states and 810 transitions. Second operand has 16 states, 13 states have (on average 4.153846153846154) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-13 13:29:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:23,779 INFO L93 Difference]: Finished difference Result 926 states and 1339 transitions. [2024-11-13 13:29:23,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:29:23,780 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.153846153846154) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) Word has length 111 [2024-11-13 13:29:23,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:23,784 INFO L225 Difference]: With dead ends: 926 [2024-11-13 13:29:23,785 INFO L226 Difference]: Without dead ends: 558 [2024-11-13 13:29:23,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:29:23,787 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 310 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:23,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 675 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 13:29:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-13 13:29:23,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 556. [2024-11-13 13:29:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 519 states have (on average 1.4084778420038535) internal successors, (731), 520 states have internal predecessors, (731), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-13 13:29:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 791 transitions. [2024-11-13 13:29:23,859 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 791 transitions. Word has length 111 [2024-11-13 13:29:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:23,859 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 791 transitions. [2024-11-13 13:29:23,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.153846153846154) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-13 13:29:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 791 transitions. [2024-11-13 13:29:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 13:29:23,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:23,861 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:23,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 13:29:23,862 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:23,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2142297131, now seen corresponding path program 1 times [2024-11-13 13:29:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:23,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240752392] [2024-11-13 13:29:23,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:23,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:29:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:29:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:29:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:29:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:29:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:29:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:29:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:29:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:29:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:29:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:29:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:29:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:29:33,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240752392] [2024-11-13 13:29:33,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240752392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:33,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:33,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 13:29:33,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928897160] [2024-11-13 13:29:33,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:33,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 13:29:33,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:33,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 13:29:33,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:29:33,215 INFO L87 Difference]: Start difference. First operand 556 states and 791 transitions. Second operand has 19 states, 15 states have (on average 3.6) internal successors, (54), 19 states have internal predecessors, (54), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-13 13:29:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:37,539 INFO L93 Difference]: Finished difference Result 958 states and 1366 transitions. [2024-11-13 13:29:37,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:29:37,540 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 3.6) internal successors, (54), 19 states have internal predecessors, (54), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) Word has length 111 [2024-11-13 13:29:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:37,543 INFO L225 Difference]: With dead ends: 958 [2024-11-13 13:29:37,543 INFO L226 Difference]: Without dead ends: 596 [2024-11-13 13:29:37,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2024-11-13 13:29:37,547 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 490 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:37,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 958 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-13 13:29:37,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-13 13:29:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 556. [2024-11-13 13:29:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 519 states have (on average 1.4007707129094413) internal successors, (727), 520 states have internal predecessors, (727), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-13 13:29:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 787 transitions. [2024-11-13 13:29:37,609 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 787 transitions. Word has length 111 [2024-11-13 13:29:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:37,610 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 787 transitions. [2024-11-13 13:29:37,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 3.6) internal successors, (54), 19 states have internal predecessors, (54), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-13 13:29:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 787 transitions. [2024-11-13 13:29:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 13:29:37,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:37,612 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:37,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 13:29:37,612 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:37,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:37,613 INFO L85 PathProgramCache]: Analyzing trace with hash 589299309, now seen corresponding path program 1 times [2024-11-13 13:29:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:37,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452360785] [2024-11-13 13:29:37,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:37,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:29:37,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [208822970] [2024-11-13 13:29:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:37,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:29:37,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:29:37,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:29:37,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:29:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:29:38,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:29:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:29:39,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:29:39,208 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:29:39,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:29:39,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:29:39,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:29:39,415 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:39,594 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:29:39,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:29:39 BoogieIcfgContainer [2024-11-13 13:29:39,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:29:39,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:29:39,599 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:29:39,599 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:29:39,600 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:27:48" (3/4) ... [2024-11-13 13:29:39,603 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:29:39,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:29:39,605 INFO L158 Benchmark]: Toolchain (without parser) took 112893.31ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 105.0MB in the beginning and 706.9MB in the end (delta: -602.0MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2024-11-13 13:29:39,606 INFO L158 Benchmark]: CDTParser took 1.43ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:29:39,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.85ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 89.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:29:39,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.45ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:29:39,607 INFO L158 Benchmark]: Boogie Preprocessor took 65.40ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 82.6MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:29:39,607 INFO L158 Benchmark]: RCFGBuilder took 1181.58ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 46.4MB in the end (delta: 35.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 13:29:39,607 INFO L158 Benchmark]: TraceAbstraction took 110936.16ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 45.7MB in the beginning and 707.2MB in the end (delta: -661.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:29:39,607 INFO L158 Benchmark]: Witness Printer took 5.74ms. Allocated memory is still 780.1MB. Free memory was 707.2MB in the beginning and 706.9MB in the end (delta: 249.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:29:39,610 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.43ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 574.85ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 89.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.45ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.40ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 82.6MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1181.58ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 46.4MB in the end (delta: 35.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 110936.16ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 45.7MB in the beginning and 707.2MB in the end (delta: -661.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.74ms. Allocated memory is still 780.1MB. Free memory was 707.2MB in the beginning and 706.9MB in the end (delta: 249.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L47] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] unsigned short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L49] unsigned short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L50] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L51] unsigned short int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L52] unsigned short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L53] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L54] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L55] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L56] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L57] unsigned short int last_1_WrapperStruct00_var_1_1 = 10; [L58] unsigned short int last_1_WrapperStruct00_var_1_9 = 8; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=0, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L110] EXPR WrapperStruct00.var_1_1 [L110] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L111] EXPR WrapperStruct00.var_1_9 [L111] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ushort() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L92] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L98] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ushort() [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L100] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L101] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L103] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L105] EXPR WrapperStruct00.var_1_12 [L105] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_12 [L105] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L106] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_13 [L107] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_13 [L107] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L122] RET updateVariables() [L123] CALL step() [L62] COND TRUE last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1) [L63] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L63] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L63] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L63] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L63] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) [L63] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L63] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L63] (*(WrapperStruct00_var_1_1_Pointer)) = (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))) [L65] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L65] (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) [L65] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L65] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L65] (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L65] COND FALSE !((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) [L76] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L76] (*(WrapperStruct00_var_1_9_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L78] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) [L85] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L85] (*(WrapperStruct00_var_1_11_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1 [L114] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L114] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L114] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) [L114] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L114] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer))))) [L114] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L114] EXPR (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L114] EXPR (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) [L114] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L114] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) [L114] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) [L114] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L114] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114-L115] return (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 110.7s, OverallIterations: 23, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 38.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5814 SdHoareTripleChecker+Valid, 28.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5778 mSDsluCounter, 13020 SdHoareTripleChecker+Invalid, 25.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10542 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14891 IncrementalHoareTripleChecker+Invalid, 15284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 2478 mSDtfsCounter, 14891 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1070 GetRequests, 778 SyntacticMatches, 1 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 18.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=562occurred in iteration=20, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 715 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 64.2s InterpolantComputationTime, 2682 NumberOfCodeBlocks, 2682 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2333 ConstructedInterpolants, 0 QuantifiedInterpolants, 38940 SizeOfPredicates, 7 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 5808/5808 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 13:29:39,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd --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 c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:29:43,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:29:43,248 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 13:29:43,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:29:43,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:29:43,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:29:43,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:29:43,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:29:43,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:29:43,346 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:29:43,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:29:43,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:29:43,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:29:43,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:29:43,347 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:29:43,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:29:43,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:29:43,352 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:29:43,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:29:43,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:29:43,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:29:43,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:29:43,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:29:43,353 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:29:43,353 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:29:43,353 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:29:43,353 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:29:43,353 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:29:43,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:29:43,353 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:29:43,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:29:43,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:29:43,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:29:43,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:29:43,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:29:43,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:29:43,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:29:43,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:29:43,366 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:29:43,366 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:29:43,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:29:43,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:29:43,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:29:43,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:29:43,367 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd 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 -> c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec [2024-11-13 13:29:43,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:29:43,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:29:43,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:29:43,807 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:29:43,808 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:29:43,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i Unable to find full path for "g++" [2024-11-13 13:29:46,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:29:46,685 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:29:46,686 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i [2024-11-13 13:29:46,698 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/data/eaa591c20/17316762684145cc8443d1a67e233a1d/FLAG0a6db8cd7 [2024-11-13 13:29:46,717 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/data/eaa591c20/17316762684145cc8443d1a67e233a1d [2024-11-13 13:29:46,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:29:46,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:29:46,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:29:46,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:29:46,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:29:46,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:29:46" (1/1) ... [2024-11-13 13:29:46,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8c882d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:46, skipping insertion in model container [2024-11-13 13:29:46,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:29:46" (1/1) ... [2024-11-13 13:29:46,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:29:47,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i[916,929] [2024-11-13 13:29:47,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:29:47,171 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:29:47,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i[916,929] [2024-11-13 13:29:47,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:29:47,308 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:29:47,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47 WrapperNode [2024-11-13 13:29:47,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:29:47,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:29:47,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:29:47,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:29:47,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (1/1) ... [2024-11-13 13:29:47,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (1/1) ... [2024-11-13 13:29:47,427 INFO L138 Inliner]: procedures = 34, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2024-11-13 13:29:47,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:29:47,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:29:47,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:29:47,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:29:47,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (1/1) ... [2024-11-13 13:29:47,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (1/1) ... [2024-11-13 13:29:47,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (1/1) ... [2024-11-13 13:29:47,523 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 26 writes are split as follows [0, 26]. [2024-11-13 13:29:47,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (1/1) ... [2024-11-13 13:29:47,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (1/1) ... [2024-11-13 13:29:47,545 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (1/1) ... [2024-11-13 13:29:47,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (1/1) ... [2024-11-13 13:29:47,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (1/1) ... [2024-11-13 13:29:47,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (1/1) ... [2024-11-13 13:29:47,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:29:47,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:29:47,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:29:47,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:29:47,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (1/1) ... [2024-11-13 13:29:47,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:29:47,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:29:47,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:29:47,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:29:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:29:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 13:29:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 13:29:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:29:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 13:29:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 13:29:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 13:29:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-13 13:29:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-13 13:29:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 13:29:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 13:29:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-13 13:29:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-13 13:29:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-13 13:29:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-13 13:29:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:29:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:29:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-13 13:29:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-13 13:29:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:29:47,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:29:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 13:29:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 13:29:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-13 13:29:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-13 13:29:47,911 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:29:47,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:29:48,982 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-13 13:29:48,982 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:29:49,006 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:29:49,006 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:29:49,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:29:49 BoogieIcfgContainer [2024-11-13 13:29:49,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:29:49,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:29:49,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:29:49,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:29:49,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:29:46" (1/3) ... [2024-11-13 13:29:49,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f7d773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:29:49, skipping insertion in model container [2024-11-13 13:29:49,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:47" (2/3) ... [2024-11-13 13:29:49,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f7d773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:29:49, skipping insertion in model container [2024-11-13 13:29:49,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:29:49" (3/3) ... [2024-11-13 13:29:49,023 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-2.i [2024-11-13 13:29:49,043 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:29:49,045 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-2.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:29:49,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:29:49,143 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b7a116c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:29:49,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:29:49,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 13:29:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 13:29:49,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:49,170 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:49,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:49,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:49,179 INFO L85 PathProgramCache]: Analyzing trace with hash 185657770, now seen corresponding path program 1 times [2024-11-13 13:29:49,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:29:49,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121366222] [2024-11-13 13:29:49,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:49,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:49,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:29:49,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:29:49,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 13:29:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:49,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 13:29:49,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:29:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-13 13:29:49,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:29:49,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:29:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121366222] [2024-11-13 13:29:49,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121366222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:49,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:29:49,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100336242] [2024-11-13 13:29:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:49,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:29:49,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:29:49,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:29:49,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:29:49,767 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 13:29:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:49,803 INFO L93 Difference]: Finished difference Result 193 states and 302 transitions. [2024-11-13 13:29:49,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:29:49,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-13 13:29:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:49,815 INFO L225 Difference]: With dead ends: 193 [2024-11-13 13:29:49,815 INFO L226 Difference]: Without dead ends: 96 [2024-11-13 13:29:49,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:29:49,823 INFO L432 NwaCegarLoop]: 141 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, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:49,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:29:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-13 13:29:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-13 13:29:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 13:29:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-11-13 13:29:49,890 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 100 [2024-11-13 13:29:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:49,891 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-11-13 13:29:49,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 13:29:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-11-13 13:29:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 13:29:49,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:49,898 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:49,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 13:29:50,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:50,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:50,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:50,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1502867838, now seen corresponding path program 1 times [2024-11-13 13:29:50,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:29:50,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559201083] [2024-11-13 13:29:50,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:50,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:50,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:29:50,105 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:29:50,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 13:29:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:50,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:29:50,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:29:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:29:50,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:29:50,659 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:29:50,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559201083] [2024-11-13 13:29:50,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559201083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:50,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:50,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:29:50,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368573107] [2024-11-13 13:29:50,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:50,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:29:50,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:29:50,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:29:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:29:50,662 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:29:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:50,734 INFO L93 Difference]: Finished difference Result 190 states and 281 transitions. [2024-11-13 13:29:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:29:50,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-13 13:29:50,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:50,737 INFO L225 Difference]: With dead ends: 190 [2024-11-13 13:29:50,737 INFO L226 Difference]: Without dead ends: 97 [2024-11-13 13:29:50,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:29:50,741 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:50,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:29:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-13 13:29:50,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-13 13:29:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 13:29:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-11-13 13:29:50,769 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 100 [2024-11-13 13:29:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:50,772 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-11-13 13:29:50,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:29:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-11-13 13:29:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 13:29:50,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:50,780 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:50,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:29:50,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:50,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:50,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:50,986 INFO L85 PathProgramCache]: Analyzing trace with hash 491750588, now seen corresponding path program 1 times [2024-11-13 13:29:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:29:50,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356031655] [2024-11-13 13:29:50,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:50,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:50,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:29:50,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:29:50,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 13:29:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:51,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:29:51,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:29:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:29:51,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:29:51,477 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:29:51,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356031655] [2024-11-13 13:29:51,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356031655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:51,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:51,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:29:51,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996329721] [2024-11-13 13:29:51,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:51,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:29:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:29:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:29:51,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:29:51,484 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:29:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:51,567 INFO L93 Difference]: Finished difference Result 193 states and 284 transitions. [2024-11-13 13:29:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:29:51,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-13 13:29:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:51,570 INFO L225 Difference]: With dead ends: 193 [2024-11-13 13:29:51,570 INFO L226 Difference]: Without dead ends: 99 [2024-11-13 13:29:51,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:29:51,572 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:51,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:29:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-13 13:29:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-13 13:29:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 13:29:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2024-11-13 13:29:51,585 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 100 [2024-11-13 13:29:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:51,587 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2024-11-13 13:29:51,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:29:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-11-13 13:29:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 13:29:51,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:51,593 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:51,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 13:29:51,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:51,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:51,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash 939798830, now seen corresponding path program 1 times [2024-11-13 13:29:51,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:29:51,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864552379] [2024-11-13 13:29:51,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:51,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:51,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:29:51,800 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:29:51,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 13:29:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:52,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:29:52,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:29:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:29:52,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:29:52,506 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:29:52,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864552379] [2024-11-13 13:29:52,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864552379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:52,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:52,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:29:52,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202266671] [2024-11-13 13:29:52,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:52,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:29:52,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:29:52,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:29:52,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:29:52,508 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:29:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:52,733 INFO L93 Difference]: Finished difference Result 236 states and 346 transitions. [2024-11-13 13:29:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:29:52,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-13 13:29:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:52,739 INFO L225 Difference]: With dead ends: 236 [2024-11-13 13:29:52,739 INFO L226 Difference]: Without dead ends: 140 [2024-11-13 13:29:52,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:29:52,741 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 54 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:52,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 276 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:29:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-13 13:29:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 115. [2024-11-13 13:29:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 101 states have internal predecessors, (145), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 13:29:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2024-11-13 13:29:52,761 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 103 [2024-11-13 13:29:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:52,762 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2024-11-13 13:29:52,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:29:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2024-11-13 13:29:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 13:29:52,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:52,764 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:52,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 13:29:52,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:52,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:52,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1907225244, now seen corresponding path program 1 times [2024-11-13 13:29:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:29:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673339839] [2024-11-13 13:29:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:52,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:52,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:29:52,970 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:29:52,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 13:29:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:53,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:29:53,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:29:53,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2024-11-13 13:29:53,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 101 [2024-11-13 13:29:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:29:54,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:29:54,533 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:29:54,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673339839] [2024-11-13 13:29:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673339839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:54,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:54,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:29:54,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728845944] [2024-11-13 13:29:54,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:54,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:29:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:29:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:29:54,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:29:54,537 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:29:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:57,054 INFO L93 Difference]: Finished difference Result 322 states and 475 transitions. [2024-11-13 13:29:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:29:57,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-13 13:29:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:57,058 INFO L225 Difference]: With dead ends: 322 [2024-11-13 13:29:57,059 INFO L226 Difference]: Without dead ends: 210 [2024-11-13 13:29:57,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:29:57,061 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 125 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:57,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 313 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 13:29:57,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-13 13:29:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 178. [2024-11-13 13:29:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 151 states have (on average 1.4105960264900663) internal successors, (213), 151 states have internal predecessors, (213), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:29:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 261 transitions. [2024-11-13 13:29:57,112 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 261 transitions. Word has length 103 [2024-11-13 13:29:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:57,113 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 261 transitions. [2024-11-13 13:29:57,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:29:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 261 transitions. [2024-11-13 13:29:57,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 13:29:57,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:57,119 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:57,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-13 13:29:57,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:57,320 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:57,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:57,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1655297943, now seen corresponding path program 1 times [2024-11-13 13:29:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:29:57,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142087138] [2024-11-13 13:29:57,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:57,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:57,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:29:57,325 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:29:57,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (7)] Waiting until timeout for monitored process [2024-11-13 13:29:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:57,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 13:29:57,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:29:59,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-13 13:30:01,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-13 13:30:03,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2024-11-13 13:30:05,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-13 13:30:07,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-13 13:30:08,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-13 13:30:09,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2024-11-13 13:30:09,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2024-11-13 13:30:10,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53 [2024-11-13 13:30:10,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:30:10,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 33 [2024-11-13 13:30:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 139 proven. 80 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 13:30:10,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:30:32,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~ite20#1| (_ BitVec 32)) (|ULTIMATE.start_property_#t~mem84#1| (_ BitVec 16)) (v_ArrVal_212 (_ BitVec 32)) (v_ArrVal_210 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) |ULTIMATE.start_step_#t~ite20#1|)))))) (store .cse2 c_~WrapperStruct00_var_1_9_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset v_ArrVal_210))))) (or (not (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))))) (not (bvsgt (let ((.cse1 (store .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_212)))) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) (bvneg ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset)))))) ((_ zero_extend 16) |ULTIMATE.start_property_#t~mem84#1|)))))) is different from false [2024-11-13 13:30:32,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:30:32,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142087138] [2024-11-13 13:30:32,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142087138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:30:32,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285608910] [2024-11-13 13:30:32,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:32,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:30:32,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:30:32,938 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:30:32,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:30:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:33,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 13:30:33,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:30:34,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-13 13:30:36,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-13 13:30:38,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-13 13:30:39,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2024-11-13 13:30:42,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2024-11-13 13:30:43,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2024-11-13 13:30:45,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2024-11-13 13:30:46,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2024-11-13 13:30:47,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 58 [2024-11-13 13:30:47,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:30:47,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 39 [2024-11-13 13:30:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 163 proven. 80 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 13:30:47,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:30:53,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285608910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:30:53,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:30:53,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 25 [2024-11-13 13:30:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128101705] [2024-11-13 13:30:53,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:30:53,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 13:30:53,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:30:53,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 13:30:53,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=778, Unknown=2, NotChecked=58, Total=992 [2024-11-13 13:30:53,450 INFO L87 Difference]: Start difference. First operand 178 states and 261 transitions. Second operand has 26 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 10 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-13 13:31:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:35,667 INFO L93 Difference]: Finished difference Result 427 states and 582 transitions. [2024-11-13 13:31:35,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-13 13:31:35,669 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 10 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) Word has length 106 [2024-11-13 13:31:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:35,672 INFO L225 Difference]: With dead ends: 427 [2024-11-13 13:31:35,672 INFO L226 Difference]: Without dead ends: 315 [2024-11-13 13:31:35,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 225 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 49.6s TimeCoverageRelationStatistics Valid=600, Invalid=2158, Unknown=2, NotChecked=102, Total=2862 [2024-11-13 13:31:35,676 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 840 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:35,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 659 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 23.1s Time] [2024-11-13 13:31:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-13 13:31:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 252. [2024-11-13 13:31:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 213 states have (on average 1.3474178403755868) internal successors, (287), 214 states have internal predecessors, (287), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-13 13:31:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 339 transitions. [2024-11-13 13:31:35,764 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 339 transitions. Word has length 106 [2024-11-13 13:31:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:35,764 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 339 transitions. [2024-11-13 13:31:35,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 10 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-13 13:31:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 339 transitions. [2024-11-13 13:31:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 13:31:35,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:35,771 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:35,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:31:35,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (7)] Ended with exit code 0 [2024-11-13 13:31:36,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:31:36,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:31:36,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1938604775, now seen corresponding path program 1 times [2024-11-13 13:31:36,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:31:36,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079233248] [2024-11-13 13:31:36,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:36,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:31:36,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:31:36,181 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:31:36,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (9)] Waiting until timeout for monitored process [2024-11-13 13:31:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:36,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 13:31:36,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:31:37,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:31:39,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:31:41,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:31:42,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:31:44,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:31:46,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:31:48,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:31:49,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-13 13:31:50,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-11-13 13:31:50,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-11-13 13:31:51,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:31:51,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 13:31:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 13:31:51,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:31:57,440 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:31:57,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079233248] [2024-11-13 13:31:57,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079233248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:31:57,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731742548] [2024-11-13 13:31:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:57,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:31:57,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:31:57,443 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:31:57,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:31:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:57,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 13:31:57,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:32:09,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-13 13:32:10,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-11-13 13:32:10,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-11-13 13:32:10,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:32:10,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 13:32:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 13:32:11,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:32:13,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1934 treesize of output 1806 [2024-11-13 13:33:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:33:17,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731742548] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 13:33:17,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:33:17,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 12] total 22 [2024-11-13 13:33:17,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716083563] [2024-11-13 13:33:17,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:33:17,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:33:17,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:33:17,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:33:17,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-11-13 13:33:17,708 INFO L87 Difference]: Start difference. First operand 252 states and 339 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:33:25,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:33:27,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:33:29,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:33:33,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:33:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:33:44,432 INFO L93 Difference]: Finished difference Result 493 states and 678 transitions. [2024-11-13 13:33:44,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:33:44,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-13 13:33:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:33:44,437 INFO L225 Difference]: With dead ends: 493 [2024-11-13 13:33:44,437 INFO L226 Difference]: Without dead ends: 329 [2024-11-13 13:33:44,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 316 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2024-11-13 13:33:44,439 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 237 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:33:44,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 529 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 620 Invalid, 1 Unknown, 0 Unchecked, 24.1s Time] [2024-11-13 13:33:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-13 13:33:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 294. [2024-11-13 13:33:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 255 states have (on average 1.3764705882352941) internal successors, (351), 256 states have internal predecessors, (351), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-13 13:33:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 403 transitions. [2024-11-13 13:33:44,504 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 403 transitions. Word has length 106 [2024-11-13 13:33:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:33:44,504 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 403 transitions. [2024-11-13 13:33:44,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:33:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 403 transitions. [2024-11-13 13:33:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:33:44,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:33:44,506 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:33:44,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (9)] Ended with exit code 0 [2024-11-13 13:33:44,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 13:33:44,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:33:44,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:33:44,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:33:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash -770771051, now seen corresponding path program 1 times [2024-11-13 13:33:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:33:44,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548332230] [2024-11-13 13:33:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:33:44,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:33:44,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:33:44,910 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:33:44,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (11)] Waiting until timeout for monitored process [2024-11-13 13:33:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:33:45,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 13:33:45,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:33:46,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:33:49,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 13:33:51,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-13 13:33:55,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 13:33:58,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 13:34:01,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 13:34:03,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 13:34:07,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2024-11-13 13:34:08,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2024-11-13 13:34:08,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2024-11-13 13:34:09,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:34:09,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 31 [2024-11-13 13:34:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 104 proven. 71 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-13 13:34:09,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:34:46,050 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:34:46,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548332230] [2024-11-13 13:34:46,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548332230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:34:46,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501039505] [2024-11-13 13:34:46,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:46,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:34:46,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:34:46,053 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:34:46,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:34:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 13:34:46,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:01,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-13 13:35:02,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-13 13:35:03,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-13 13:35:04,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:04,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 22 [2024-11-13 13:35:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:35:04,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:04,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501039505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:04,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:35:04,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 25 [2024-11-13 13:35:04,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025811261] [2024-11-13 13:35:04,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:04,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:35:04,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:04,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:35:04,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1021, Unknown=6, NotChecked=0, Total=1190 [2024-11-13 13:35:04,627 INFO L87 Difference]: Start difference. First operand 294 states and 403 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:35:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:35:14,536 INFO L93 Difference]: Finished difference Result 559 states and 781 transitions. [2024-11-13 13:35:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:35:14,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-13 13:35:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:35:14,541 INFO L225 Difference]: With dead ends: 559 [2024-11-13 13:35:14,541 INFO L226 Difference]: Without dead ends: 372 [2024-11-13 13:35:14,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=214, Invalid=1186, Unknown=6, NotChecked=0, Total=1406 [2024-11-13 13:35:14,545 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 271 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:35:14,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 490 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-11-13 13:35:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-13 13:35:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 337. [2024-11-13 13:35:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 298 states have (on average 1.3993288590604027) internal successors, (417), 299 states have internal predecessors, (417), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-13 13:35:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 469 transitions. [2024-11-13 13:35:14,620 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 469 transitions. Word has length 108 [2024-11-13 13:35:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:35:14,621 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 469 transitions. [2024-11-13 13:35:14,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:35:14,621 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 469 transitions. [2024-11-13 13:35:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:35:14,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:14,623 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:35:14,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:35:14,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (11)] Ended with exit code 0 [2024-11-13 13:35:15,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:35:15,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:35:15,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:15,024 INFO L85 PathProgramCache]: Analyzing trace with hash 223428915, now seen corresponding path program 1 times [2024-11-13 13:35:15,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:15,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514047941] [2024-11-13 13:35:15,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:15,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:35:15,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:35:15,027 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:35:15,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (13)] Waiting until timeout for monitored process [2024-11-13 13:35:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:15,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 13:35:15,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:15,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:15,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 62 [2024-11-13 13:35:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:35:16,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:16,900 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:16,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514047941] [2024-11-13 13:35:16,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514047941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:16,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:16,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:35:16,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62193958] [2024-11-13 13:35:16,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:16,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:35:16,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:16,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:35:16,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:35:16,902 INFO L87 Difference]: Start difference. First operand 337 states and 469 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:35:18,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:35:21,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:35:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:35:23,051 INFO L93 Difference]: Finished difference Result 573 states and 805 transitions. [2024-11-13 13:35:23,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:35:23,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-13 13:35:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:35:23,058 INFO L225 Difference]: With dead ends: 573 [2024-11-13 13:35:23,059 INFO L226 Difference]: Without dead ends: 343 [2024-11-13 13:35:23,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:35:23,063 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 4 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:35:23,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 403 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-13 13:35:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-13 13:35:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2024-11-13 13:35:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 300 states have (on average 1.3966666666666667) internal successors, (419), 301 states have internal predecessors, (419), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-13 13:35:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 471 transitions. [2024-11-13 13:35:23,132 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 471 transitions. Word has length 108 [2024-11-13 13:35:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:35:23,132 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 471 transitions. [2024-11-13 13:35:23,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:35:23,133 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 471 transitions. [2024-11-13 13:35:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:35:23,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:23,134 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:35:23,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (13)] Ended with exit code 0 [2024-11-13 13:35:23,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:35:23,335 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:35:23,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash 646130741, now seen corresponding path program 1 times [2024-11-13 13:35:23,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:23,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261921799] [2024-11-13 13:35:23,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:23,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:35:23,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:35:23,338 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:35:23,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (14)] Waiting until timeout for monitored process [2024-11-13 13:35:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:23,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 13:35:23,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:25,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-13 13:35:28,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 13:35:31,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-13 13:35:34,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-13 13:35:38,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-13 13:35:42,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-13 13:35:44,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-13 13:35:50,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2024-11-13 13:35:52,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2024-11-13 13:35:53,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2024-11-13 13:35:54,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:35:54,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 31 [2024-11-13 13:35:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 168 proven. 71 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 13:35:54,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:36:29,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:36:29,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261921799] [2024-11-13 13:36:29,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261921799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:36:29,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108323545] [2024-11-13 13:36:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:29,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:29,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:36:29,089 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:36:29,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 13:36:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:29,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 13:36:29,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:36:45,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 13:36:46,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-13 13:36:47,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-13 13:36:48,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:36:48,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 23 [2024-11-13 13:36:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 13:36:48,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:36:48,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108323545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:36:48,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:36:48,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2024-11-13 13:36:48,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850867625] [2024-11-13 13:36:48,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:36:48,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:36:48,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:36:48,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:36:48,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1212, Unknown=6, NotChecked=0, Total=1406 [2024-11-13 13:36:48,825 INFO L87 Difference]: Start difference. First operand 339 states and 471 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:36:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:36:58,341 INFO L93 Difference]: Finished difference Result 627 states and 883 transitions. [2024-11-13 13:36:58,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:36:58,344 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-13 13:36:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:36:58,347 INFO L225 Difference]: With dead ends: 627 [2024-11-13 13:36:58,347 INFO L226 Difference]: Without dead ends: 416 [2024-11-13 13:36:58,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 46.4s TimeCoverageRelationStatistics Valid=239, Invalid=1395, Unknown=6, NotChecked=0, Total=1640 [2024-11-13 13:36:58,351 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 343 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:36:58,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 542 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-13 13:36:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-13 13:36:58,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 382. [2024-11-13 13:36:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 343 states have (on average 1.4081632653061225) internal successors, (483), 344 states have internal predecessors, (483), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-13 13:36:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 535 transitions. [2024-11-13 13:36:58,446 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 535 transitions. Word has length 108 [2024-11-13 13:36:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:36:58,447 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 535 transitions. [2024-11-13 13:36:58,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 13:36:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 535 transitions. [2024-11-13 13:36:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 13:36:58,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:36:58,448 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:36:58,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 13:36:58,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (14)] Ended with exit code 0 [2024-11-13 13:36:58,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:36:58,849 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:36:58,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:36:58,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1034667283, now seen corresponding path program 1 times [2024-11-13 13:36:58,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:36:58,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924622600] [2024-11-13 13:36:58,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:58,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:36:58,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:36:58,852 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:36:58,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (16)] Waiting until timeout for monitored process [2024-11-13 13:36:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:59,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 13:36:59,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:37:02,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:37:04,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-13 13:37:08,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-13 13:37:11,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-13 13:37:14,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-13 13:37:16,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-13 13:37:21,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 66 [2024-11-13 13:37:22,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 71 [2024-11-13 13:37:23,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:37:23,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 51 [2024-11-13 13:37:24,176 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 161 proven. 80 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-13 13:37:24,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:37:38,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:37:38,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924622600] [2024-11-13 13:37:38,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924622600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:37:38,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955585577] [2024-11-13 13:37:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:37:38,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:37:38,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:37:38,277 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:37:38,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 13:37:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:37:38,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 13:37:38,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:37:41,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:37:43,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 13:37:47,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 13:37:50,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 13:37:52,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 13:37:54,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 13:37:57,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-11-13 13:37:59,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2024-11-13 13:38:00,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:38:00,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 35 [2024-11-13 13:38:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 132 proven. 80 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 13:38:00,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:38:04,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955585577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:38:04,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:38:04,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 29 [2024-11-13 13:38:04,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114342463] [2024-11-13 13:38:04,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:38:04,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 13:38:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:38:04,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 13:38:04,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1262, Unknown=2, NotChecked=0, Total=1482 [2024-11-13 13:38:04,761 INFO L87 Difference]: Start difference. First operand 382 states and 535 transitions. Second operand has 30 states, 27 states have (on average 3.925925925925926) internal successors, (106), 29 states have internal predecessors, (106), 11 states have call successors, (20), 8 states have call predecessors, (20), 11 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2024-11-13 13:38:52,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:39:03,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:39:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:39:17,175 INFO L93 Difference]: Finished difference Result 632 states and 883 transitions. [2024-11-13 13:39:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-13 13:39:17,178 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 3.925925925925926) internal successors, (106), 29 states have internal predecessors, (106), 11 states have call successors, (20), 8 states have call predecessors, (20), 11 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) Word has length 108 [2024-11-13 13:39:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:39:17,181 INFO L225 Difference]: With dead ends: 632 [2024-11-13 13:39:17,181 INFO L226 Difference]: Without dead ends: 394 [2024-11-13 13:39:17,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 46.2s TimeCoverageRelationStatistics Valid=654, Invalid=2884, Unknown=2, NotChecked=0, Total=3540 [2024-11-13 13:39:17,183 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 342 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:39:17,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 846 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 55.2s Time] [2024-11-13 13:39:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-13 13:39:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 343. [2024-11-13 13:39:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 306 states have (on average 1.4019607843137254) internal successors, (429), 306 states have internal predecessors, (429), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 13:39:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 477 transitions. [2024-11-13 13:39:17,265 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 477 transitions. Word has length 108 [2024-11-13 13:39:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:39:17,265 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 477 transitions. [2024-11-13 13:39:17,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 3.925925925925926) internal successors, (106), 29 states have internal predecessors, (106), 11 states have call successors, (20), 8 states have call predecessors, (20), 11 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2024-11-13 13:39:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 477 transitions. [2024-11-13 13:39:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 13:39:17,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:39:17,267 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:39:17,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (16)] Forceful destruction successful, exit code 0 [2024-11-13 13:39:17,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-13 13:39:17,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:39:17,668 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:39:17,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:39:17,669 INFO L85 PathProgramCache]: Analyzing trace with hash -545685217, now seen corresponding path program 1 times [2024-11-13 13:39:17,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:39:17,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22611715] [2024-11-13 13:39:17,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:39:17,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:39:17,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:39:17,671 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:39:17,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/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 (18)] Waiting until timeout for monitored process [2024-11-13 13:39:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:39:18,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-13 13:39:18,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:39:21,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:39:25,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-13 13:39:30,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-13 13:39:34,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2024-11-13 13:39:38,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2024-11-13 13:39:41,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2024-11-13 13:39:45,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2024-11-13 13:39:46,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 67 [2024-11-13 13:39:47,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 77 [2024-11-13 13:39:49,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:39:49,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 111 treesize of output 59 [2024-11-13 13:39:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 161 proven. 80 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-13 13:39:50,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:39:59,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:39:59,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22611715] [2024-11-13 13:39:59,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22611715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:39:59,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32931056] [2024-11-13 13:39:59,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:39:59,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:39:59,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:39:59,092 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:39:59,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_505ec1ad-3c75-4722-98a3-af2ef57705ec/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 13:39:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:39:59,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 13:39:59,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:40:02,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-13 13:40:08,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-13 13:40:15,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-13 13:40:20,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2024-11-13 13:40:24,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2024-11-13 13:40:27,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2024-11-13 13:40:31,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2024-11-13 13:40:33,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2024-11-13 13:40:35,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2024-11-13 13:40:38,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:40:38,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 48 [2024-11-13 13:40:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 104 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-13 13:40:38,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:40:39,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32931056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:40:39,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:40:39,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 37 [2024-11-13 13:40:39,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406241941] [2024-11-13 13:40:39,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:40:39,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 13:40:39,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:40:39,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 13:40:39,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1637, Unknown=1, NotChecked=0, Total=1892 [2024-11-13 13:40:39,908 INFO L87 Difference]: Start difference. First operand 343 states and 477 transitions. Second operand has 38 states, 34 states have (on average 3.735294117647059) internal successors, (127), 34 states have internal predecessors, (127), 14 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (23), 12 states have call predecessors, (23), 14 states have call successors, (23)