./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1 --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 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 13:39:30,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 13:39:30,821 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 13:39:30,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 13:39:30,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 13:39:30,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 13:39:30,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 13:39:30,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 13:39:30,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 13:39:30,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 13:39:30,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 13:39:30,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 13:39:30,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 13:39:30,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 13:39:30,851 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 13:39:30,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 13:39:30,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 13:39:30,852 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 13:39:30,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 13:39:30,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 13:39:30,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 13:39:30,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 13:39:30,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 13:39:30,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 13:39:30,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 13:39:30,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 13:39:30,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 13:39:30,853 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 13:39:30,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 13:39:30,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:39:30,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:39:30,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:39:30,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:39:30,853 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 13:39:30,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:39:30,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:39:30,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:39:30,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:39:30,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 13:39:30,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 13:39:30,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 13:39:30,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 13:39:30,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 13:39:30,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 13:39:30,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 13:39:30,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 13:39:30,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 13:39:30,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 13:39:30,855 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_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1 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 -> 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd [2024-12-02 13:39:31,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 13:39:31,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 13:39:31,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 13:39:31,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 13:39:31,150 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 13:39:31,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2024-12-02 13:39:33,990 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/data/2ed09072a/ff7d8436517b4c26bb88e81e8122ac24/FLAG13cabc5dc [2024-12-02 13:39:34,238 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 13:39:34,239 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2024-12-02 13:39:34,248 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/data/2ed09072a/ff7d8436517b4c26bb88e81e8122ac24/FLAG13cabc5dc [2024-12-02 13:39:34,540 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/data/2ed09072a/ff7d8436517b4c26bb88e81e8122ac24 [2024-12-02 13:39:34,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 13:39:34,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 13:39:34,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 13:39:34,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 13:39:34,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 13:39:34,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fb6154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34, skipping insertion in model container [2024-12-02 13:39:34,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 13:39:34,706 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_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i[916,929] [2024-12-02 13:39:34,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:39:34,774 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 13:39:34,785 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_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i[916,929] [2024-12-02 13:39:34,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:39:34,843 INFO L204 MainTranslator]: Completed translation [2024-12-02 13:39:34,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34 WrapperNode [2024-12-02 13:39:34,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 13:39:34,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 13:39:34,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 13:39:34,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 13:39:34,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,901 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 520 [2024-12-02 13:39:34,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 13:39:34,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 13:39:34,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 13:39:34,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 13:39:34,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,925 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-12-02 13:39:34,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,944 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 13:39:34,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 13:39:34,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 13:39:34,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 13:39:34,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (1/1) ... [2024-12-02 13:39:34,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:39:34,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:39:34,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 13:39:34,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 13:39:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 13:39:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-12-02 13:39:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-12-02 13:39:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-12-02 13:39:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-02 13:39:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-12-02 13:39:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-02 13:39:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 13:39:35,020 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 13:39:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-02 13:39:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 13:39:35,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 13:39:35,135 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 13:39:35,137 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 13:39:35,888 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-12-02 13:39:35,889 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 13:39:35,899 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 13:39:35,900 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 13:39:35,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:39:35 BoogieIcfgContainer [2024-12-02 13:39:35,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 13:39:35,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 13:39:35,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 13:39:35,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 13:39:35,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:39:34" (1/3) ... [2024-12-02 13:39:35,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc036c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:39:35, skipping insertion in model container [2024-12-02 13:39:35,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:39:34" (2/3) ... [2024-12-02 13:39:35,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc036c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:39:35, skipping insertion in model container [2024-12-02 13:39:35,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:39:35" (3/3) ... [2024-12-02 13:39:35,909 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-88.i [2024-12-02 13:39:35,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 13:39:35,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-88.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 13:39:35,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 13:39:36,003 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;@666f4570, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 13:39:36,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 13:39:36,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-12-02 13:39:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-02 13:39:36,019 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:36,019 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:36,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:36,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:36,025 INFO L85 PathProgramCache]: Analyzing trace with hash -100183722, now seen corresponding path program 1 times [2024-12-02 13:39:36,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:36,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297408436] [2024-12-02 13:39:36,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:36,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-12-02 13:39:36,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:36,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297408436] [2024-12-02 13:39:36,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297408436] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:39:36,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665018613] [2024-12-02 13:39:36,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:36,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:39:36,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:39:36,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:39:36,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 13:39:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:36,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-02 13:39:36,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:39:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-12-02 13:39:36,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 13:39:36,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665018613] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:36,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 13:39:36,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-12-02 13:39:36,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537111928] [2024-12-02 13:39:36,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:36,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 13:39:36,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:36,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 13:39:36,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 13:39:36,691 INFO L87 Difference]: Start difference. First operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:39:36,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:36,720 INFO L93 Difference]: Finished difference Result 231 states and 361 transitions. [2024-12-02 13:39:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 13:39:36,722 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-12-02 13:39:36,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:36,728 INFO L225 Difference]: With dead ends: 231 [2024-12-02 13:39:36,728 INFO L226 Difference]: Without dead ends: 115 [2024-12-02 13:39:36,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-12-02 13:39:36,734 INFO L435 NwaCegarLoop]: 168 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, 168 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-12-02 13:39:36,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:39:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-12-02 13:39:36,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-12-02 13:39:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-12-02 13:39:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2024-12-02 13:39:36,773 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2024-12-02 13:39:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:36,773 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2024-12-02 13:39:36,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:39:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2024-12-02 13:39:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-02 13:39:36,777 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:36,777 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:36,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 13:39:36,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:39:36,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:36,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:36,979 INFO L85 PathProgramCache]: Analyzing trace with hash 753164736, now seen corresponding path program 1 times [2024-12-02 13:39:36,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:36,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340405279] [2024-12-02 13:39:36,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:36,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:37,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:37,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340405279] [2024-12-02 13:39:37,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340405279] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:37,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:39:37,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:39:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321012329] [2024-12-02 13:39:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:37,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 13:39:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:37,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 13:39:37,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:39:37,297 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:39:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:37,343 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2024-12-02 13:39:37,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 13:39:37,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-12-02 13:39:37,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:37,345 INFO L225 Difference]: With dead ends: 229 [2024-12-02 13:39:37,345 INFO L226 Difference]: Without dead ends: 117 [2024-12-02 13:39:37,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-02 13:39:37,347 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 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.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:37,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:39:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-12-02 13:39:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-12-02 13:39:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-12-02 13:39:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-12-02 13:39:37,360 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2024-12-02 13:39:37,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:37,361 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-12-02 13:39:37,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:39:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-12-02 13:39:37,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-02 13:39:37,364 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:37,364 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:37,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 13:39:37,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:37,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:37,365 INFO L85 PathProgramCache]: Analyzing trace with hash -122854270, now seen corresponding path program 1 times [2024-12-02 13:39:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:37,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528209850] [2024-12-02 13:39:37,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:37,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:37,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:37,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528209850] [2024-12-02 13:39:37,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528209850] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:37,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:39:37,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:39:37,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338838732] [2024-12-02 13:39:37,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:37,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 13:39:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:37,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 13:39:37,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:39:37,658 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:37,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:37,701 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2024-12-02 13:39:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 13:39:37,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-12-02 13:39:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:37,704 INFO L225 Difference]: With dead ends: 234 [2024-12-02 13:39:37,705 INFO L226 Difference]: Without dead ends: 120 [2024-12-02 13:39:37,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-02 13:39:37,706 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:37,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 484 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:39:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-12-02 13:39:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-12-02 13:39:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-12-02 13:39:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-12-02 13:39:37,717 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2024-12-02 13:39:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:37,717 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-12-02 13:39:37,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-12-02 13:39:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-02 13:39:37,720 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:37,720 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:37,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 13:39:37,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:37,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:37,721 INFO L85 PathProgramCache]: Analyzing trace with hash 557204100, now seen corresponding path program 1 times [2024-12-02 13:39:37,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:37,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799571520] [2024-12-02 13:39:37,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:37,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:38,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:38,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799571520] [2024-12-02 13:39:38,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799571520] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:38,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:39:38,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:39:38,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383365046] [2024-12-02 13:39:38,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:38,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 13:39:38,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:38,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 13:39:38,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:39:38,028 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:38,064 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2024-12-02 13:39:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 13:39:38,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-12-02 13:39:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:38,067 INFO L225 Difference]: With dead ends: 238 [2024-12-02 13:39:38,067 INFO L226 Difference]: Without dead ends: 122 [2024-12-02 13:39:38,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-02 13:39:38,069 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:38,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 485 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:39:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-12-02 13:39:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-12-02 13:39:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-12-02 13:39:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2024-12-02 13:39:38,079 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2024-12-02 13:39:38,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:38,080 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2024-12-02 13:39:38,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2024-12-02 13:39:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-02 13:39:38,083 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:38,083 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:38,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 13:39:38,083 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:38,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:38,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1962755834, now seen corresponding path program 1 times [2024-12-02 13:39:38,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:38,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772061391] [2024-12-02 13:39:38,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:38,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:38,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:38,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772061391] [2024-12-02 13:39:38,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772061391] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:38,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:39:38,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:39:38,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191613356] [2024-12-02 13:39:38,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:38,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 13:39:38,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:38,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 13:39:38,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:39:38,382 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:38,415 INFO L93 Difference]: Finished difference Result 242 states and 349 transitions. [2024-12-02 13:39:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 13:39:38,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-12-02 13:39:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:38,417 INFO L225 Difference]: With dead ends: 242 [2024-12-02 13:39:38,417 INFO L226 Difference]: Without dead ends: 124 [2024-12-02 13:39:38,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-02 13:39:38,419 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:38,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:39:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-12-02 13:39:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-12-02 13:39:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-12-02 13:39:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2024-12-02 13:39:38,429 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 143 [2024-12-02 13:39:38,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:38,430 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2024-12-02 13:39:38,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2024-12-02 13:39:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-02 13:39:38,433 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:38,433 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:38,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 13:39:38,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:38,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:38,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1960908792, now seen corresponding path program 1 times [2024-12-02 13:39:38,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:38,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425262206] [2024-12-02 13:39:38,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:38,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:39,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425262206] [2024-12-02 13:39:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425262206] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:39,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:39:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 13:39:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607110148] [2024-12-02 13:39:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:39,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:39:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:39,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:39:39,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:39:39,621 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:39,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:39,976 INFO L93 Difference]: Finished difference Result 259 states and 369 transitions. [2024-12-02 13:39:39,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:39:39,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-12-02 13:39:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:39,980 INFO L225 Difference]: With dead ends: 259 [2024-12-02 13:39:39,980 INFO L226 Difference]: Without dead ends: 139 [2024-12-02 13:39:39,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 13:39:39,981 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 88 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:39,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 440 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 13:39:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-12-02 13:39:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2024-12-02 13:39:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.3333333333333333) internal successors, (152), 115 states have internal predecessors, (152), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-12-02 13:39:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 194 transitions. [2024-12-02 13:39:39,993 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 194 transitions. Word has length 143 [2024-12-02 13:39:39,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:39,993 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 194 transitions. [2024-12-02 13:39:39,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:39,993 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 194 transitions. [2024-12-02 13:39:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-02 13:39:39,995 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:39,995 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:39,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 13:39:39,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:39,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:39,996 INFO L85 PathProgramCache]: Analyzing trace with hash -224934086, now seen corresponding path program 1 times [2024-12-02 13:39:39,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:39,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655193937] [2024-12-02 13:39:39,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:39,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-12-02 13:39:40,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:40,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655193937] [2024-12-02 13:39:40,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655193937] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:39:40,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615219985] [2024-12-02 13:39:40,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:40,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:39:40,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:39:40,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:39:40,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 13:39:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:40,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 13:39:40,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:39:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:40,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 13:39:40,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615219985] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:40,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 13:39:40,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-12-02 13:39:40,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260460407] [2024-12-02 13:39:40,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:40,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:39:40,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:40,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:39:40,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 13:39:40,595 INFO L87 Difference]: Start difference. First operand 138 states and 194 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:40,638 INFO L93 Difference]: Finished difference Result 267 states and 376 transitions. [2024-12-02 13:39:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:39:40,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-12-02 13:39:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:40,641 INFO L225 Difference]: With dead ends: 267 [2024-12-02 13:39:40,641 INFO L226 Difference]: Without dead ends: 141 [2024-12-02 13:39:40,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 13:39:40,642 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:40,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:39:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-12-02 13:39:40,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-12-02 13:39:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 118 states have internal predecessors, (155), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-12-02 13:39:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 197 transitions. [2024-12-02 13:39:40,653 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 197 transitions. Word has length 145 [2024-12-02 13:39:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:40,654 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 197 transitions. [2024-12-02 13:39:40,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 197 transitions. [2024-12-02 13:39:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-02 13:39:40,656 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:40,656 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:40,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-12-02 13:39:40,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-12-02 13:39:40,857 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:40,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash 885375514, now seen corresponding path program 1 times [2024-12-02 13:39:40,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:40,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282684832] [2024-12-02 13:39:40,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:41,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:41,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282684832] [2024-12-02 13:39:41,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282684832] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:41,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:39:41,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 13:39:41,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509167922] [2024-12-02 13:39:41,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:41,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 13:39:41,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:41,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 13:39:41,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:39:41,909 INFO L87 Difference]: Start difference. First operand 141 states and 197 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:42,370 INFO L93 Difference]: Finished difference Result 271 states and 379 transitions. [2024-12-02 13:39:42,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:39:42,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-12-02 13:39:42,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:42,374 INFO L225 Difference]: With dead ends: 271 [2024-12-02 13:39:42,374 INFO L226 Difference]: Without dead ends: 142 [2024-12-02 13:39:42,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-12-02 13:39:42,375 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 83 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:42,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 563 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 13:39:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-12-02 13:39:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-12-02 13:39:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 116 states have internal predecessors, (152), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-12-02 13:39:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2024-12-02 13:39:42,386 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 194 transitions. Word has length 146 [2024-12-02 13:39:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:42,386 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 194 transitions. [2024-12-02 13:39:42,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2024-12-02 13:39:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-02 13:39:42,388 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:42,389 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:42,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 13:39:42,389 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:42,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash 945808159, now seen corresponding path program 1 times [2024-12-02 13:39:42,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:42,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210143286] [2024-12-02 13:39:42,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:42,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:43,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:43,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210143286] [2024-12-02 13:39:43,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210143286] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:43,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:39:43,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:39:43,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520512488] [2024-12-02 13:39:43,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:43,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 13:39:43,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:43,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 13:39:43,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:39:43,287 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:43,708 INFO L93 Difference]: Finished difference Result 381 states and 535 transitions. [2024-12-02 13:39:43,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 13:39:43,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-12-02 13:39:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:43,710 INFO L225 Difference]: With dead ends: 381 [2024-12-02 13:39:43,710 INFO L226 Difference]: Without dead ends: 254 [2024-12-02 13:39:43,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:39:43,712 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 146 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:43,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 364 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 13:39:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-12-02 13:39:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2024-12-02 13:39:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 166 states have (on average 1.3132530120481927) internal successors, (218), 166 states have internal predecessors, (218), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-12-02 13:39:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 286 transitions. [2024-12-02 13:39:43,734 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 286 transitions. Word has length 147 [2024-12-02 13:39:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:43,735 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 286 transitions. [2024-12-02 13:39:43,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 286 transitions. [2024-12-02 13:39:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-02 13:39:43,737 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:43,737 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:43,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 13:39:43,737 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:43,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:43,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1270086649, now seen corresponding path program 1 times [2024-12-02 13:39:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552050085] [2024-12-02 13:39:43,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:44,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:44,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552050085] [2024-12-02 13:39:44,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552050085] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:44,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:39:44,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 13:39:44,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692117932] [2024-12-02 13:39:44,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:44,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:39:44,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:44,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:39:44,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:39:44,156 INFO L87 Difference]: Start difference. First operand 204 states and 286 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:44,386 INFO L93 Difference]: Finished difference Result 371 states and 516 transitions. [2024-12-02 13:39:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:39:44,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-12-02 13:39:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:44,389 INFO L225 Difference]: With dead ends: 371 [2024-12-02 13:39:44,389 INFO L226 Difference]: Without dead ends: 244 [2024-12-02 13:39:44,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:39:44,390 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 86 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:44,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 418 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 13:39:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-12-02 13:39:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 208. [2024-12-02 13:39:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 170 states have (on average 1.311764705882353) internal successors, (223), 170 states have internal predecessors, (223), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-12-02 13:39:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 291 transitions. [2024-12-02 13:39:44,414 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 291 transitions. Word has length 151 [2024-12-02 13:39:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:44,414 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 291 transitions. [2024-12-02 13:39:44,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 291 transitions. [2024-12-02 13:39:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-02 13:39:44,416 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:44,416 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:44,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 13:39:44,417 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:44,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:44,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1488941367, now seen corresponding path program 1 times [2024-12-02 13:39:44,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:44,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281747893] [2024-12-02 13:39:44,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:44,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:45,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:45,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281747893] [2024-12-02 13:39:45,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281747893] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:45,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:39:45,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 13:39:45,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945759410] [2024-12-02 13:39:45,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:45,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 13:39:45,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:45,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 13:39:45,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:39:45,172 INFO L87 Difference]: Start difference. First operand 208 states and 291 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:45,740 INFO L93 Difference]: Finished difference Result 392 states and 544 transitions. [2024-12-02 13:39:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:39:45,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-12-02 13:39:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:45,743 INFO L225 Difference]: With dead ends: 392 [2024-12-02 13:39:45,743 INFO L226 Difference]: Without dead ends: 261 [2024-12-02 13:39:45,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-12-02 13:39:45,744 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 129 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:45,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 599 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 13:39:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-12-02 13:39:45,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 211. [2024-12-02 13:39:45,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 173 states have (on average 1.30635838150289) internal successors, (226), 173 states have internal predecessors, (226), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-12-02 13:39:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 294 transitions. [2024-12-02 13:39:45,764 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 294 transitions. Word has length 151 [2024-12-02 13:39:45,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:45,764 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 294 transitions. [2024-12-02 13:39:45,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 294 transitions. [2024-12-02 13:39:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-02 13:39:45,766 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:45,766 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:45,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 13:39:45,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:45,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:45,767 INFO L85 PathProgramCache]: Analyzing trace with hash 422808358, now seen corresponding path program 1 times [2024-12-02 13:39:45,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:45,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258834648] [2024-12-02 13:39:45,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:45,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:47,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:47,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258834648] [2024-12-02 13:39:47,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258834648] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:47,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:39:47,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 13:39:47,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122197318] [2024-12-02 13:39:47,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:47,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 13:39:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:47,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 13:39:47,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 13:39:47,776 INFO L87 Difference]: Start difference. First operand 211 states and 294 transitions. Second operand has 8 states, 6 states have (on average 11.666666666666666) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-12-02 13:39:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:48,666 INFO L93 Difference]: Finished difference Result 433 states and 595 transitions. [2024-12-02 13:39:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 13:39:48,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.666666666666666) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2024-12-02 13:39:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:48,669 INFO L225 Difference]: With dead ends: 433 [2024-12-02 13:39:48,670 INFO L226 Difference]: Without dead ends: 302 [2024-12-02 13:39:48,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-12-02 13:39:48,671 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 75 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:48,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 876 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 13:39:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-12-02 13:39:48,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2024-12-02 13:39:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 251 states have (on average 1.294820717131474) internal successors, (325), 252 states have internal predecessors, (325), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-12-02 13:39:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 409 transitions. [2024-12-02 13:39:48,703 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 409 transitions. Word has length 152 [2024-12-02 13:39:48,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:48,704 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 409 transitions. [2024-12-02 13:39:48,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.666666666666666) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-12-02 13:39:48,704 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 409 transitions. [2024-12-02 13:39:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-02 13:39:48,707 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:48,707 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:48,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 13:39:48,707 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:48,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:48,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1686606453, now seen corresponding path program 1 times [2024-12-02 13:39:48,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:48,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280909415] [2024-12-02 13:39:48,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:48,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:48,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:48,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280909415] [2024-12-02 13:39:48,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280909415] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:48,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:39:48,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:39:48,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62646040] [2024-12-02 13:39:48,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:48,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:39:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:48,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:39:48,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:39:48,859 INFO L87 Difference]: Start difference. First operand 299 states and 409 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:48,893 INFO L93 Difference]: Finished difference Result 514 states and 705 transitions. [2024-12-02 13:39:48,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:39:48,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2024-12-02 13:39:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:48,896 INFO L225 Difference]: With dead ends: 514 [2024-12-02 13:39:48,896 INFO L226 Difference]: Without dead ends: 301 [2024-12-02 13:39:48,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-02 13:39:48,898 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:48,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:39:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-12-02 13:39:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-12-02 13:39:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 253 states have (on average 1.2924901185770752) internal successors, (327), 254 states have internal predecessors, (327), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-12-02 13:39:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2024-12-02 13:39:48,929 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 154 [2024-12-02 13:39:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:48,929 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2024-12-02 13:39:48,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:39:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2024-12-02 13:39:48,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-02 13:39:48,932 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:48,933 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:48,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 13:39:48,933 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:48,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1541026190, now seen corresponding path program 1 times [2024-12-02 13:39:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:48,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001482555] [2024-12-02 13:39:48,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:48,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:39:50,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:50,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001482555] [2024-12-02 13:39:50,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001482555] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:39:50,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:39:50,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 13:39:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462410465] [2024-12-02 13:39:50,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:39:50,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 13:39:50,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:50,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 13:39:50,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 13:39:50,055 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:39:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:39:50,674 INFO L93 Difference]: Finished difference Result 313 states and 423 transitions. [2024-12-02 13:39:50,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 13:39:50,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2024-12-02 13:39:50,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:39:50,676 INFO L225 Difference]: With dead ends: 313 [2024-12-02 13:39:50,676 INFO L226 Difference]: Without dead ends: 311 [2024-12-02 13:39:50,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-12-02 13:39:50,677 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 96 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 13:39:50,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 810 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 13:39:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-12-02 13:39:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-12-02 13:39:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 262 states have (on average 1.282442748091603) internal successors, (336), 263 states have internal predecessors, (336), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-12-02 13:39:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 420 transitions. [2024-12-02 13:39:50,695 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 420 transitions. Word has length 154 [2024-12-02 13:39:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:39:50,696 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 420 transitions. [2024-12-02 13:39:50,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:39:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 420 transitions. [2024-12-02 13:39:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-02 13:39:50,697 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:39:50,697 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:39:50,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 13:39:50,698 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:39:50,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:39:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1539179148, now seen corresponding path program 1 times [2024-12-02 13:39:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:39:50,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568962556] [2024-12-02 13:39:50,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:50,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:39:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-12-02 13:39:51,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:39:51,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568962556] [2024-12-02 13:39:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568962556] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:39:51,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230056616] [2024-12-02 13:39:51,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:39:51,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:39:51,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:39:51,999 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:39:52,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 13:39:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:39:52,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-12-02 13:39:52,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:39:52,542 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 55 treesize of output 54 [2024-12-02 13:39:52,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 82 treesize of output 71 [2024-12-02 13:39:52,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 86 treesize of output 73 [2024-12-02 13:39:53,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 90 treesize of output 75 [2024-12-02 13:39:53,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 94 treesize of output 77 [2024-12-02 13:39:53,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 98 treesize of output 79 [2024-12-02 13:39:53,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 102 treesize of output 81 [2024-12-02 13:39:54,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 115 treesize of output 90 [2024-12-02 13:39:54,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 121 treesize of output 94 [2024-12-02 13:39:54,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 121 treesize of output 94 [2024-12-02 13:39:55,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 125 treesize of output 96 [2024-12-02 13:39:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 504 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-12-02 13:39:55,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:39:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-12-02 13:39:55,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230056616] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:39:55,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:39:55,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 9] total 31 [2024-12-02 13:39:55,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17298016] [2024-12-02 13:39:55,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:39:55,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-12-02 13:39:55,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:39:55,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-12-02 13:39:55,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2024-12-02 13:39:55,965 INFO L87 Difference]: Start difference. First operand 311 states and 420 transitions. Second operand has 31 states, 27 states have (on average 6.555555555555555) internal successors, (177), 30 states have internal predecessors, (177), 17 states have call successors, (51), 9 states have call predecessors, (51), 12 states have return successors, (51), 14 states have call predecessors, (51), 17 states have call successors, (51) [2024-12-02 13:40:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:40:01,081 INFO L93 Difference]: Finished difference Result 857 states and 1124 transitions. [2024-12-02 13:40:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-12-02 13:40:01,082 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 6.555555555555555) internal successors, (177), 30 states have internal predecessors, (177), 17 states have call successors, (51), 9 states have call predecessors, (51), 12 states have return successors, (51), 14 states have call predecessors, (51), 17 states have call successors, (51) Word has length 154 [2024-12-02 13:40:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:40:01,085 INFO L225 Difference]: With dead ends: 857 [2024-12-02 13:40:01,086 INFO L226 Difference]: Without dead ends: 613 [2024-12-02 13:40:01,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=963, Invalid=3069, Unknown=0, NotChecked=0, Total=4032 [2024-12-02 13:40:01,088 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 440 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:40:01,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1214 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-12-02 13:40:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-12-02 13:40:01,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 587. [2024-12-02 13:40:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 500 states have (on average 1.272) internal successors, (636), 502 states have internal predecessors, (636), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-12-02 13:40:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 770 transitions. [2024-12-02 13:40:01,133 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 770 transitions. Word has length 154 [2024-12-02 13:40:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:40:01,133 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 770 transitions. [2024-12-02 13:40:01,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 6.555555555555555) internal successors, (177), 30 states have internal predecessors, (177), 17 states have call successors, (51), 9 states have call predecessors, (51), 12 states have return successors, (51), 14 states have call predecessors, (51), 17 states have call successors, (51) [2024-12-02 13:40:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 770 transitions. [2024-12-02 13:40:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-02 13:40:01,136 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:01,136 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:40:01,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 13:40:01,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-12-02 13:40:01,336 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:01,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:01,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2018937927, now seen corresponding path program 1 times [2024-12-02 13:40:01,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:40:01,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533720822] [2024-12-02 13:40:01,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:01,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:40:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:40:02,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:40:02,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533720822] [2024-12-02 13:40:02,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533720822] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:40:02,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:40:02,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 13:40:02,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63159683] [2024-12-02 13:40:02,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:40:02,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 13:40:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:40:02,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 13:40:02,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:40:02,363 INFO L87 Difference]: Start difference. First operand 587 states and 770 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:40:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:40:02,669 INFO L93 Difference]: Finished difference Result 1139 states and 1512 transitions. [2024-12-02 13:40:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:40:02,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2024-12-02 13:40:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:40:02,674 INFO L225 Difference]: With dead ends: 1139 [2024-12-02 13:40:02,674 INFO L226 Difference]: Without dead ends: 889 [2024-12-02 13:40:02,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 13:40:02,676 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 160 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:40:02,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 412 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 13:40:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-12-02 13:40:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 596. [2024-12-02 13:40:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 509 states have (on average 1.2730844793713163) internal successors, (648), 511 states have internal predecessors, (648), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-12-02 13:40:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 782 transitions. [2024-12-02 13:40:02,716 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 782 transitions. Word has length 156 [2024-12-02 13:40:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:40:02,716 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 782 transitions. [2024-12-02 13:40:02,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:40:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 782 transitions. [2024-12-02 13:40:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-02 13:40:02,718 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:02,718 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:40:02,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 13:40:02,718 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:02,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:02,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1386278343, now seen corresponding path program 1 times [2024-12-02 13:40:02,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:40:02,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976423937] [2024-12-02 13:40:02,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:02,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:40:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:04,526 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:40:04,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:40:04,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976423937] [2024-12-02 13:40:04,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976423937] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:40:04,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:40:04,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 13:40:04,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203641223] [2024-12-02 13:40:04,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:40:04,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 13:40:04,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:40:04,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 13:40:04,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 13:40:04,528 INFO L87 Difference]: Start difference. First operand 596 states and 782 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:40:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:40:05,207 INFO L93 Difference]: Finished difference Result 1060 states and 1401 transitions. [2024-12-02 13:40:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 13:40:05,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2024-12-02 13:40:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:40:05,211 INFO L225 Difference]: With dead ends: 1060 [2024-12-02 13:40:05,211 INFO L226 Difference]: Without dead ends: 604 [2024-12-02 13:40:05,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-12-02 13:40:05,212 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 162 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 13:40:05,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 475 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 13:40:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-12-02 13:40:05,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 600. [2024-12-02 13:40:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 512 states have (on average 1.267578125) internal successors, (649), 514 states have internal predecessors, (649), 67 states have call successors, (67), 20 states have call predecessors, (67), 20 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-12-02 13:40:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 783 transitions. [2024-12-02 13:40:05,257 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 783 transitions. Word has length 156 [2024-12-02 13:40:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:40:05,257 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 783 transitions. [2024-12-02 13:40:05,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:40:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 783 transitions. [2024-12-02 13:40:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-02 13:40:05,259 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:05,259 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:40:05,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 13:40:05,259 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:05,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:05,260 INFO L85 PathProgramCache]: Analyzing trace with hash -258180644, now seen corresponding path program 1 times [2024-12-02 13:40:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:40:05,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147148291] [2024-12-02 13:40:05,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:05,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:40:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:40:06,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:40:06,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147148291] [2024-12-02 13:40:06,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147148291] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:40:06,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:40:06,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 13:40:06,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765903004] [2024-12-02 13:40:06,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:40:06,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 13:40:06,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:40:06,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 13:40:06,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:40:06,233 INFO L87 Difference]: Start difference. First operand 600 states and 783 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:40:06,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:40:06,603 INFO L93 Difference]: Finished difference Result 1341 states and 1766 transitions. [2024-12-02 13:40:06,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 13:40:06,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2024-12-02 13:40:06,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:40:06,606 INFO L225 Difference]: With dead ends: 1341 [2024-12-02 13:40:06,606 INFO L226 Difference]: Without dead ends: 881 [2024-12-02 13:40:06,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 13:40:06,607 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 63 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 13:40:06,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 533 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 13:40:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-12-02 13:40:06,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 673. [2024-12-02 13:40:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 585 states have (on average 1.2752136752136751) internal successors, (746), 587 states have internal predecessors, (746), 67 states have call successors, (67), 20 states have call predecessors, (67), 20 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-12-02 13:40:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 880 transitions. [2024-12-02 13:40:06,655 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 880 transitions. Word has length 156 [2024-12-02 13:40:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:40:06,655 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 880 transitions. [2024-12-02 13:40:06,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:40:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 880 transitions. [2024-12-02 13:40:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-02 13:40:06,657 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:06,657 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:40:06,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 13:40:06,657 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:06,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash 189485414, now seen corresponding path program 1 times [2024-12-02 13:40:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:40:06,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509982477] [2024-12-02 13:40:06,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:40:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:40:06,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:40:06,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509982477] [2024-12-02 13:40:06,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509982477] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:40:06,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:40:06,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:40:06,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988898564] [2024-12-02 13:40:06,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:40:06,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:40:06,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:40:06,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:40:06,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:40:06,757 INFO L87 Difference]: Start difference. First operand 673 states and 880 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:40:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:40:06,806 INFO L93 Difference]: Finished difference Result 1214 states and 1603 transitions. [2024-12-02 13:40:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:40:06,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2024-12-02 13:40:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:40:06,810 INFO L225 Difference]: With dead ends: 1214 [2024-12-02 13:40:06,810 INFO L226 Difference]: Without dead ends: 680 [2024-12-02 13:40:06,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-02 13:40:06,812 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 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-12-02 13:40:06,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:40:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-12-02 13:40:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2024-12-02 13:40:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 592 states have (on average 1.2719594594594594) internal successors, (753), 594 states have internal predecessors, (753), 67 states have call successors, (67), 20 states have call predecessors, (67), 20 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-12-02 13:40:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 887 transitions. [2024-12-02 13:40:06,855 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 887 transitions. Word has length 156 [2024-12-02 13:40:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:40:06,856 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 887 transitions. [2024-12-02 13:40:06,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:40:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 887 transitions. [2024-12-02 13:40:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-02 13:40:06,857 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:06,857 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:40:06,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 13:40:06,858 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1595291205, now seen corresponding path program 1 times [2024-12-02 13:40:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:40:06,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357991089] [2024-12-02 13:40:06,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:06,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:40:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:40:07,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:40:07,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357991089] [2024-12-02 13:40:07,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357991089] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:40:07,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:40:07,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 13:40:07,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904040761] [2024-12-02 13:40:07,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:40:07,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 13:40:07,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:40:07,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 13:40:07,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:40:07,281 INFO L87 Difference]: Start difference. First operand 680 states and 887 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:40:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:40:07,784 INFO L93 Difference]: Finished difference Result 1466 states and 1925 transitions. [2024-12-02 13:40:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:40:07,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2024-12-02 13:40:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:40:07,787 INFO L225 Difference]: With dead ends: 1466 [2024-12-02 13:40:07,787 INFO L226 Difference]: Without dead ends: 897 [2024-12-02 13:40:07,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-12-02 13:40:07,788 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 139 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 13:40:07,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 533 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 13:40:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-12-02 13:40:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 679. [2024-12-02 13:40:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 591 states have (on average 1.2690355329949239) internal successors, (750), 593 states have internal predecessors, (750), 67 states have call successors, (67), 20 states have call predecessors, (67), 20 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-12-02 13:40:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 884 transitions. [2024-12-02 13:40:07,835 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 884 transitions. Word has length 156 [2024-12-02 13:40:07,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:40:07,835 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 884 transitions. [2024-12-02 13:40:07,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:40:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 884 transitions. [2024-12-02 13:40:07,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-02 13:40:07,837 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:07,837 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:40:07,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 13:40:07,837 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:07,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:07,838 INFO L85 PathProgramCache]: Analyzing trace with hash -625743125, now seen corresponding path program 1 times [2024-12-02 13:40:07,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:40:07,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712125476] [2024-12-02 13:40:07,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:07,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:40:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:40:08,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:40:08,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712125476] [2024-12-02 13:40:08,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712125476] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:40:08,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:40:08,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 13:40:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937202923] [2024-12-02 13:40:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:40:08,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 13:40:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:40:08,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 13:40:08,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:40:08,914 INFO L87 Difference]: Start difference. First operand 679 states and 884 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:40:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:40:09,476 INFO L93 Difference]: Finished difference Result 1483 states and 1942 transitions. [2024-12-02 13:40:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 13:40:09,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2024-12-02 13:40:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:40:09,479 INFO L225 Difference]: With dead ends: 1483 [2024-12-02 13:40:09,479 INFO L226 Difference]: Without dead ends: 969 [2024-12-02 13:40:09,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 13:40:09,481 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 185 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 13:40:09,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 570 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 13:40:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-12-02 13:40:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 904. [2024-12-02 13:40:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 785 states have (on average 1.2535031847133757) internal successors, (984), 789 states have internal predecessors, (984), 92 states have call successors, (92), 26 states have call predecessors, (92), 26 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2024-12-02 13:40:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1168 transitions. [2024-12-02 13:40:09,536 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1168 transitions. Word has length 158 [2024-12-02 13:40:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:40:09,536 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1168 transitions. [2024-12-02 13:40:09,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:40:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1168 transitions. [2024-12-02 13:40:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-02 13:40:09,537 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:09,537 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:40:09,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 13:40:09,538 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:09,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1578950146, now seen corresponding path program 1 times [2024-12-02 13:40:09,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:40:09,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692225727] [2024-12-02 13:40:09,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:09,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:40:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 13:40:09,670 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 13:40:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 13:40:09,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 13:40:09,818 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 13:40:09,819 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 13:40:09,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 13:40:09,824 INFO L422 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] [2024-12-02 13:40:09,886 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 13:40:09,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:40:09 BoogieIcfgContainer [2024-12-02 13:40:09,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 13:40:09,890 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 13:40:09,890 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 13:40:09,891 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 13:40:09,891 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:39:35" (3/4) ... [2024-12-02 13:40:09,894 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 13:40:09,895 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 13:40:09,895 INFO L158 Benchmark]: Toolchain (without parser) took 35351.79ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 115.9MB in the beginning and 164.8MB in the end (delta: -48.9MB). Peak memory consumption was 233.7MB. Max. memory is 16.1GB. [2024-12-02 13:40:09,896 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 142.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:40:09,896 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.09ms. Allocated memory is still 142.6MB. Free memory was 115.7MB in the beginning and 98.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 13:40:09,896 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.88ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 95.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:40:09,896 INFO L158 Benchmark]: Boogie Preprocessor took 57.19ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 91.8MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 13:40:09,896 INFO L158 Benchmark]: RCFGBuilder took 940.96ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 58.3MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-02 13:40:09,897 INFO L158 Benchmark]: TraceAbstraction took 33986.90ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 57.7MB in the beginning and 164.8MB in the end (delta: -107.1MB). Peak memory consumption was 175.0MB. Max. memory is 16.1GB. [2024-12-02 13:40:09,897 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 427.8MB. Free memory was 164.8MB in the beginning and 164.8MB in the end (delta: 25.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:40:09,899 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 142.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.09ms. Allocated memory is still 142.6MB. Free memory was 115.7MB in the beginning and 98.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.88ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 95.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.19ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 91.8MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 940.96ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 58.3MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 33986.90ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 57.7MB in the beginning and 164.8MB in the end (delta: -107.1MB). Peak memory consumption was 175.0MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 427.8MB. Free memory was 164.8MB in the beginning and 164.8MB in the end (delta: 25.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of bitwiseOr at line 124, overapproximation of bitwiseOr at line 65. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L59] unsigned long int last_1_WrapperStruct00_var_1_10 = 25; [L60] signed short int last_1_WrapperStruct00_var_1_15 = -16; [L61] unsigned char last_1_WrapperStruct00_var_1_18 = 0; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L128] isInitial = 1 [L129] FCALL initially() [L131] CALL updateLastVariables() [L119] EXPR WrapperStruct00.var_1_10 [L119] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_15 [L120] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L121] EXPR WrapperStruct00.var_1_18 [L121] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L94] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L97] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L100] WrapperStruct00.var_1_9 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L106] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L110] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L112] WrapperStruct00.var_1_17 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_17 [L113] EXPR WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_17 [L113] EXPR WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] EXPR (WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L114] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L132] RET updateVariables() [L133] CALL step() [L65] EXPR last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L65] ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 [L65] EXPR WrapperStruct00.var_1_5 [L65] ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L65] COND FALSE !(((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) [L72] EXPR WrapperStruct00.var_1_7 [L72] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_7 [L74] WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L74] COND FALSE !(WrapperStruct00.var_1_5) [L77] EXPR WrapperStruct00.var_1_12 [L77] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L77] COND TRUE WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8 [L78] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L78] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) [L78] EXPR WrapperStruct00.var_1_8 [L78] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L78] WrapperStruct00.var_1_14 = ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) [L80] WrapperStruct00.var_1_15 = 2 [L81] EXPR WrapperStruct00.var_1_17 [L81] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_17 [L82] EXPR WrapperStruct00.var_1_19 [L82] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L83] EXPR WrapperStruct00.var_1_8 [L83] EXPR WrapperStruct00.var_1_1 [L83] unsigned char stepLocal_0 = WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1; [L84] stepLocal_0 && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L84] COND FALSE !(stepLocal_0 && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) [L87] EXPR WrapperStruct00.var_1_11 [L87] EXPR WrapperStruct00.var_1_13 [L87] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 [L124] EXPR WrapperStruct00.var_1_5 [L124] EXPR ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) [L124] EXPR WrapperStruct00.var_1_1 [L124] EXPR WrapperStruct00.var_1_7 [L124] EXPR (((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1) [L124] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13)))) [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR WrapperStruct00.var_1_1 [L124] EXPR (WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))) [L124] EXPR WrapperStruct00.var_1_10 [L124] EXPR WrapperStruct00.var_1_11 [L124] EXPR WrapperStruct00.var_1_13 [L124] EXPR ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1) [L124] EXPR WrapperStruct00.var_1_12 [L124] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1 [L124] EXPR WrapperStruct00.var_1_14 [L124] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2)) [L124] EXPR WrapperStruct00.var_1_15 [L124] EXPR (((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17)) [L124] EXPR WrapperStruct00.var_1_16 [L124] EXPR WrapperStruct00.var_1_17 [L124] EXPR ((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124-L125] return (((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_19)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.9s, OverallIterations: 22, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1863 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1855 mSDsluCounter, 11210 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8068 mSDsCounter, 494 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5271 IncrementalHoareTripleChecker+Invalid, 5765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 494 mSolverCounterUnsat, 3142 mSDtfsCounter, 5271 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 854 GetRequests, 701 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=21, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 960 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 3750 NumberOfCodeBlocks, 3750 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3721 ConstructedInterpolants, 0 QuantifiedInterpolants, 20471 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1603 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 25 InterpolantComputations, 20 PerfectInterpolantSequences, 12986/13600 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-12-02 13:40:09,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1 --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 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 13:40:11,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 13:40:12,083 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-12-02 13:40:12,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 13:40:12,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 13:40:12,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 13:40:12,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 13:40:12,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 13:40:12,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 13:40:12,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 13:40:12,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 13:40:12,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 13:40:12,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 13:40:12,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 13:40:12,118 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 13:40:12,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 13:40:12,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 13:40:12,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 13:40:12,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 13:40:12,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 13:40:12,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 13:40:12,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 13:40:12,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 13:40:12,119 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 13:40:12,119 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 13:40:12,119 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 13:40:12,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 13:40:12,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 13:40:12,119 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 13:40:12,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 13:40:12,119 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 13:40:12,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:40:12,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:40:12,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:40:12,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:40:12,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 13:40:12,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:40:12,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:40:12,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:40:12,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:40:12,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 13:40:12,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 13:40:12,121 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 13:40:12,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 13:40:12,122 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 13:40:12,122 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 13:40:12,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 13:40:12,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 13:40:12,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 13:40:12,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 13:40:12,122 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_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1 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 -> 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd [2024-12-02 13:40:12,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 13:40:12,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 13:40:12,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 13:40:12,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 13:40:12,417 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 13:40:12,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2024-12-02 13:40:15,170 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/data/fb7fd6aaf/f751171bff92421b88d37f4a0d89faf8/FLAG1b6c00a31 [2024-12-02 13:40:15,369 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 13:40:15,370 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2024-12-02 13:40:15,378 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/data/fb7fd6aaf/f751171bff92421b88d37f4a0d89faf8/FLAG1b6c00a31 [2024-12-02 13:40:15,393 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/data/fb7fd6aaf/f751171bff92421b88d37f4a0d89faf8 [2024-12-02 13:40:15,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 13:40:15,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 13:40:15,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 13:40:15,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 13:40:15,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 13:40:15,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aff9c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15, skipping insertion in model container [2024-12-02 13:40:15,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 13:40:15,544 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_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i[916,929] [2024-12-02 13:40:15,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:40:15,614 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 13:40:15,627 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_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i[916,929] [2024-12-02 13:40:15,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:40:15,702 INFO L204 MainTranslator]: Completed translation [2024-12-02 13:40:15,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15 WrapperNode [2024-12-02 13:40:15,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 13:40:15,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 13:40:15,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 13:40:15,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 13:40:15,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,762 INFO L138 Inliner]: procedures = 37, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2024-12-02 13:40:15,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 13:40:15,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 13:40:15,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 13:40:15,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 13:40:15,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,800 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2024-12-02 13:40:15,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,821 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 13:40:15,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 13:40:15,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 13:40:15,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 13:40:15,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (1/1) ... [2024-12-02 13:40:15,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:40:15,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:40:15,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 13:40:15,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 13:40:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 13:40:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-12-02 13:40:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-12-02 13:40:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 13:40:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-12-02 13:40:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-12-02 13:40:15,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-12-02 13:40:15,901 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 13:40:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 13:40:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-12-02 13:40:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-12-02 13:40:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 13:40:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 13:40:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-12-02 13:40:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-12-02 13:40:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-12-02 13:40:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-12-02 13:40:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-12-02 13:40:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-12-02 13:40:16,046 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 13:40:16,049 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 13:40:16,670 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-12-02 13:40:16,670 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 13:40:16,682 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 13:40:16,682 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 13:40:16,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:40:16 BoogieIcfgContainer [2024-12-02 13:40:16,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 13:40:16,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 13:40:16,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 13:40:16,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 13:40:16,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:40:15" (1/3) ... [2024-12-02 13:40:16,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560a98ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:40:16, skipping insertion in model container [2024-12-02 13:40:16,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:40:15" (2/3) ... [2024-12-02 13:40:16,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560a98ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:40:16, skipping insertion in model container [2024-12-02 13:40:16,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:40:16" (3/3) ... [2024-12-02 13:40:16,692 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-88.i [2024-12-02 13:40:16,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 13:40:16,716 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-88.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 13:40:16,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 13:40:16,772 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;@1bf08814, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 13:40:16,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 13:40:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-12-02 13:40:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-02 13:40:16,787 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:16,788 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:40:16,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:16,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash -700881897, now seen corresponding path program 1 times [2024-12-02 13:40:16,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 13:40:16,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691777680] [2024-12-02 13:40:16,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:16,802 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-12-02 13:40:16,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 13:40:16,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:16,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:17,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-02 13:40:17,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:40:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-12-02 13:40:17,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 13:40:17,160 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 13:40:17,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691777680] [2024-12-02 13:40:17,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691777680] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:40:17,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:40:17,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:40:17,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375663006] [2024-12-02 13:40:17,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:40:17,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 13:40:17,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 13:40:17,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 13:40:17,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 13:40:17,189 INFO L87 Difference]: Start difference. First operand has 111 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:40:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:40:17,217 INFO L93 Difference]: Finished difference Result 215 states and 337 transitions. [2024-12-02 13:40:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 13:40:17,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2024-12-02 13:40:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:40:17,226 INFO L225 Difference]: With dead ends: 215 [2024-12-02 13:40:17,226 INFO L226 Difference]: Without dead ends: 107 [2024-12-02 13:40:17,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-12-02 13:40:17,233 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 13:40:17,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 13:40:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-12-02 13:40:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-12-02 13:40:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-12-02 13:40:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2024-12-02 13:40:17,277 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 139 [2024-12-02 13:40:17,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:40:17,277 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2024-12-02 13:40:17,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 13:40:17,278 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-12-02 13:40:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-02 13:40:17,281 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:17,281 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:40:17,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:17,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:17,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:17,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash -298632831, now seen corresponding path program 1 times [2024-12-02 13:40:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 13:40:17,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415490324] [2024-12-02 13:40:17,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:17,484 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-12-02 13:40:17,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 13:40:17,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:17,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:17,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 13:40:17,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:40:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:40:17,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 13:40:17,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 13:40:17,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415490324] [2024-12-02 13:40:17,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415490324] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:40:17,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:40:17,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 13:40:17,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099283580] [2024-12-02 13:40:17,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:40:17,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 13:40:17,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 13:40:17,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 13:40:17,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:40:17,848 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:40:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:40:17,950 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2024-12-02 13:40:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:40:17,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-12-02 13:40:17,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:40:17,953 INFO L225 Difference]: With dead ends: 218 [2024-12-02 13:40:17,953 INFO L226 Difference]: Without dead ends: 114 [2024-12-02 13:40:17,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:40:17,955 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:40:17,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:40:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-12-02 13:40:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-12-02 13:40:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-12-02 13:40:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2024-12-02 13:40:17,970 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 139 [2024-12-02 13:40:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:40:17,972 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2024-12-02 13:40:17,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:40:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2024-12-02 13:40:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-02 13:40:17,976 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:17,976 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:40:17,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:18,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:18,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:18,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash 381425539, now seen corresponding path program 1 times [2024-12-02 13:40:18,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 13:40:18,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617696247] [2024-12-02 13:40:18,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:18,178 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-12-02 13:40:18,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 13:40:18,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:18,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:18,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-02 13:40:18,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:40:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-12-02 13:40:18,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 13:40:18,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 13:40:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617696247] [2024-12-02 13:40:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617696247] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:40:18,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:40:18,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 13:40:18,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625778128] [2024-12-02 13:40:18,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:40:18,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 13:40:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 13:40:18,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 13:40:18,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 13:40:18,540 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:40:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 13:40:18,660 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2024-12-02 13:40:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 13:40:18,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-12-02 13:40:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 13:40:18,662 INFO L225 Difference]: With dead ends: 228 [2024-12-02 13:40:18,663 INFO L226 Difference]: Without dead ends: 118 [2024-12-02 13:40:18,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 13:40:18,664 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 13:40:18,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 992 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 13:40:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-12-02 13:40:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-12-02 13:40:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-12-02 13:40:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-12-02 13:40:18,676 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 139 [2024-12-02 13:40:18,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 13:40:18,677 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-12-02 13:40:18,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-12-02 13:40:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-12-02 13:40:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-02 13:40:18,680 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 13:40:18,680 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:40:18,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:18,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:18,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 13:40:18,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:40:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash 383272581, now seen corresponding path program 1 times [2024-12-02 13:40:18,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 13:40:18,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602850868] [2024-12-02 13:40:18,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:40:18,882 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-12-02 13:40:18,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 13:40:18,884 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:18,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:40:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:40:19,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-12-02 13:40:19,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:40:19,205 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 87 treesize of output 86 [2024-12-02 13:40:19,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 165 treesize of output 138 [2024-12-02 13:40:20,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 170 treesize of output 143 [2024-12-02 13:40:20,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 165 treesize of output 138 [2024-12-02 13:40:21,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 160 treesize of output 135 [2024-12-02 13:40:23,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 160 treesize of output 137 [2024-12-02 13:40:30,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 160 treesize of output 137 [2024-12-02 13:40:50,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 175 treesize of output 148 [2024-12-02 13:41:12,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 181 treesize of output 152 [2024-12-02 13:41:39,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 181 treesize of output 152 [2024-12-02 13:42:18,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 181 treesize of output 150 [2024-12-02 13:43:04,960 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 180 treesize of output 152 [2024-12-02 13:43:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 147 proven. 295 refuted. 57 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-02 13:43:05,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:43:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-12-02 13:43:09,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 13:43:09,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602850868] [2024-12-02 13:43:09,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602850868] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:43:09,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 13:43:09,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 24 [2024-12-02 13:43:09,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097747295] [2024-12-02 13:43:09,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 13:43:09,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-12-02 13:43:09,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 13:43:09,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-12-02 13:43:09,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=381, Unknown=36, NotChecked=0, Total=552 [2024-12-02 13:43:09,938 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 24 states, 22 states have (on average 5.409090909090909) internal successors, (119), 23 states have internal predecessors, (119), 13 states have call successors, (34), 9 states have call predecessors, (34), 11 states have return successors, (34), 12 states have call predecessors, (34), 13 states have call successors, (34) [2024-12-02 13:43:30,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 13:43:38,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 13:43:47,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 13:43:57,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 13:44:01,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 13:44:12,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 13:44:18,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 13:44:28,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 13:44:33,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 13:44:37,686 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-12-02 13:44:37,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-12-02 13:44:37,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 172.4s TimeCoverageRelationStatistics Valid=153, Invalid=410, Unknown=37, NotChecked=0, Total=600 [2024-12-02 13:44:37,688 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.9s IncrementalHoareTripleChecker+Time [2024-12-02 13:44:37,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 15 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 9 Unknown, 0 Unchecked, 73.9s Time] [2024-12-02 13:44:37,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:44:37,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 13:44:37,890 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:388) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-12-02 13:44:37,894 INFO L158 Benchmark]: Toolchain (without parser) took 262497.12ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 69.9MB in the beginning and 37.9MB in the end (delta: 32.0MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2024-12-02 13:44:37,894 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:44:37,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.43ms. Allocated memory is still 92.3MB. Free memory was 69.8MB in the beginning and 51.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 13:44:37,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.96ms. Allocated memory is still 92.3MB. Free memory was 51.7MB in the beginning and 48.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:44:37,895 INFO L158 Benchmark]: Boogie Preprocessor took 73.77ms. Allocated memory is still 92.3MB. Free memory was 48.3MB in the beginning and 43.7MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 13:44:37,895 INFO L158 Benchmark]: RCFGBuilder took 844.95ms. Allocated memory is still 92.3MB. Free memory was 43.7MB in the beginning and 36.4MB in the end (delta: 7.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-12-02 13:44:37,895 INFO L158 Benchmark]: TraceAbstraction took 261208.96ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 35.7MB in the beginning and 37.9MB in the end (delta: -2.1MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2024-12-02 13:44:37,897 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.43ms. Allocated memory is still 92.3MB. Free memory was 69.8MB in the beginning and 51.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.96ms. Allocated memory is still 92.3MB. Free memory was 51.7MB in the beginning and 48.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.77ms. Allocated memory is still 92.3MB. Free memory was 48.3MB in the beginning and 43.7MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 844.95ms. Allocated memory is still 92.3MB. Free memory was 43.7MB in the beginning and 36.4MB in the end (delta: 7.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 261208.96ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 35.7MB in the beginning and 37.9MB in the end (delta: -2.1MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d255f1d-89e8-4ce8-bdd9-e50bd6dcbdf2/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken